/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/vnew2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:29:36,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:29:36,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:29:36,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:29:36,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:29:36,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:29:36,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:29:36,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:29:36,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:29:36,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:29:36,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:29:36,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:29:36,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:29:36,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:29:36,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:29:36,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:29:36,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:29:36,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:29:36,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:29:36,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:29:36,381 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:29:36,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:29:36,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:29:36,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:29:36,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:29:36,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:29:36,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:29:36,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:29:36,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:29:36,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:29:36,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:29:36,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:29:36,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:29:36,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:29:36,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:29:36,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:29:36,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:29:36,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:29:36,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:29:36,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:29:36,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:29:36,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:29:36,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:29:36,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:29:36,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:29:36,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:29:36,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:29:36,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:29:36,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:29:36,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:29:36,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:29:36,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:29:36,409 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:29:36,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:29:36,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:29:36,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:29:36,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:29:36,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:29:36,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:29:36,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:29:36,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:29:36,411 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:29:36,411 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:29:36,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:29:36,411 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:29:36,411 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:29:36,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:29:36,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:29:36,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:29:36,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:29:36,692 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:29:36,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-08 10:29:36,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ff42d5a/eb7565b888eb4b01aa88dfe9342ed62f/FLAG7303716ee [2022-04-08 10:29:37,178 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:29:37,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-08 10:29:37,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ff42d5a/eb7565b888eb4b01aa88dfe9342ed62f/FLAG7303716ee [2022-04-08 10:29:37,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ff42d5a/eb7565b888eb4b01aa88dfe9342ed62f [2022-04-08 10:29:37,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:29:37,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:29:37,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:29:37,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:29:37,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:29:37,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b796c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37, skipping insertion in model container [2022-04-08 10:29:37,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:29:37,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:29:37,807 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/vnew2.c[403,416] [2022-04-08 10:29:37,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:29:37,850 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:29:37,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c[403,416] [2022-04-08 10:29:37,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:29:37,890 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:29:37,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37 WrapperNode [2022-04-08 10:29:37,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:29:37,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:29:37,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:29:37,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:29:37,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:29:37,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:29:37,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:29:37,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:29:37,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (1/1) ... [2022-04-08 10:29:37,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:29:37,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:37,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:29:37,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:29:38,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:29:38,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:29:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:29:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:29:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:29:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:29:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:29:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:29:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:29:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:29:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:29:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:29:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:29:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:29:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:29:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:29:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:29:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:29:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:29:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:29:38,082 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:29:38,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:29:38,258 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:29:38,272 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:29:38,272 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:29:38,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:29:38 BoogieIcfgContainer [2022-04-08 10:29:38,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:29:38,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:29:38,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:29:38,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:29:38,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:29:37" (1/3) ... [2022-04-08 10:29:38,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f75815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:29:38, skipping insertion in model container [2022-04-08 10:29:38,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:29:37" (2/3) ... [2022-04-08 10:29:38,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f75815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:29:38, skipping insertion in model container [2022-04-08 10:29:38,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:29:38" (3/3) ... [2022-04-08 10:29:38,297 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew2.c [2022-04-08 10:29:38,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:29:38,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:29:38,374 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:29:38,382 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:29:38,382 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:29:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:29:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 10:29:38,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:38,412 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:38,413 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash -818707046, now seen corresponding path program 1 times [2022-04-08 10:29:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:38,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628905495] [2022-04-08 10:29:38,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:29:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -818707046, now seen corresponding path program 2 times [2022-04-08 10:29:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063995243] [2022-04-08 10:29:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:38,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:38,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330359030] [2022-04-08 10:29:38,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:29:38,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:38,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:29:38,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:29:38,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:29:38,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:38,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:29:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:38,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:38,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-08 10:29:38,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#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; {24#true} is VALID [2022-04-08 10:29:38,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 10:29:38,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-08 10:29:38,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-08 10:29:38,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-08 10:29:38,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {47#(= main_~i~0 0)} is VALID [2022-04-08 10:29:38,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {51#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:29:38,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(not (< 0 (mod main_~n~0 4294967296)))} assume ~n~0 % 4294967296 > 0; {25#false} is VALID [2022-04-08 10:29:38,762 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-08 10:29:38,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 10:29:38,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 10:29:38,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 10:29:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:38,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:29:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063995243] [2022-04-08 10:29:38,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:38,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330359030] [2022-04-08 10:29:38,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330359030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:38,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:38,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:29:38,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:38,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628905495] [2022-04-08 10:29:38,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628905495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:38,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:38,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:29:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83999222] [2022-04-08 10:29:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-08 10:29:38,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:38,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:38,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:38,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:29:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:29:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:29:38,857 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:39,016 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 10:29:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:29:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-08 10:29:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 10:29:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 10:29:39,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-08 10:29:39,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:39,114 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:29:39,115 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:29:39,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:29:39,124 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:39,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:29:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:29:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 10:29:39,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:39,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,160 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,161 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:39,174 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:29:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:29:39,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:39,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:39,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 10:29:39,185 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 10:29:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:39,187 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:29:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:29:39,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:39,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:39,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:39,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 10:29:39,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 10:29:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:39,191 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 10:29:39,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:39,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 10:29:39,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:29:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:29:39,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:39,212 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:39,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:39,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 10:29:39,415 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1914943323, now seen corresponding path program 1 times [2022-04-08 10:29:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024085152] [2022-04-08 10:29:39,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:39,436 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1914943323, now seen corresponding path program 2 times [2022-04-08 10:29:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323241273] [2022-04-08 10:29:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:39,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:39,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958396233] [2022-04-08 10:29:39,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:29:39,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:39,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:39,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:29:39,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:29:39,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:29:39,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:39,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:29:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:39,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-08 10:29:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#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; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:39,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#(= ~SIZE~0 20000001)} assume true; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:39,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#(= ~SIZE~0 20000001)} {212#true} #55#return; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:39,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:39,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:39,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {236#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:39,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {240#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:29:39,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {240#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:29:39,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume ~n~0 % 4294967296 > 0; {240#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:29:39,783 INFO L272 TraceCheckUtils]: 10: Hoare triple {240#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:39,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:39,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {213#false} is VALID [2022-04-08 10:29:39,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-08 10:29:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:39,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:40,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-08 10:29:40,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {213#false} is VALID [2022-04-08 10:29:40,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:40,475 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:40,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {270#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {270#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:40,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {270#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {270#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:40,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {270#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:40,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {280#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} is VALID [2022-04-08 10:29:40,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:40,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:40,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {212#true} #55#return; {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:40,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:40,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#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; {284#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:40,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-08 10:29:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323241273] [2022-04-08 10:29:40,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958396233] [2022-04-08 10:29:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958396233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:40,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:40,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 10:29:40,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024085152] [2022-04-08 10:29:40,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024085152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:40,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:40,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:29:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821287125] [2022-04-08 10:29:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:40,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-08 10:29:40,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:40,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:40,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:40,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:29:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:29:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:29:40,511 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:40,682 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:29:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:29:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-08 10:29:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-08 10:29:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-08 10:29:40,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-08 10:29:40,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:40,724 INFO L225 Difference]: With dead ends: 22 [2022-04-08 10:29:40,725 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 10:29:40,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:29:40,726 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:40,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:29:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 10:29:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 10:29:40,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:40,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-08 10:29:40,733 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-08 10:29:40,733 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-08 10:29:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:40,735 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 10:29:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:29:40,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:40,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:40,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 10:29:40,737 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 10:29:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:40,740 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 10:29:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:29:40,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:40,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:40,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:40,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-08 10:29:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 10:29:40,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 10:29:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:40,752 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 10:29:40,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:40,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 10:29:40,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 10:29:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:29:40,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:40,771 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:40,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:40,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 10:29:40,987 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:40,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 758758842, now seen corresponding path program 3 times [2022-04-08 10:29:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911039365] [2022-04-08 10:29:40,993 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:40,993 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash 758758842, now seen corresponding path program 4 times [2022-04-08 10:29:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:40,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532412142] [2022-04-08 10:29:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:41,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:41,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [97858859] [2022-04-08 10:29:41,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:29:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:41,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:29:41,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 10:29:41,092 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:29:41,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:41,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:29:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:41,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:41,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 10:29:41,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#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; {425#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:41,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#(= ~SIZE~0 20000001)} assume true; {425#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:41,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#(= ~SIZE~0 20000001)} {417#true} #55#return; {425#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:41,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {425#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:41,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {425#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:41,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {441#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:41,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {441#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {445#(and (= main_~j~0 3) (= main_~k~0 3) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:41,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(and (= main_~j~0 3) (= main_~k~0 3) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {449#(and (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} is VALID [2022-04-08 10:29:41,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#(and (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {453#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} is VALID [2022-04-08 10:29:41,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {453#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} assume ~n~0 % 4294967296 > 0; {449#(and (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} is VALID [2022-04-08 10:29:41,613 INFO L272 TraceCheckUtils]: 11: Hoare triple {449#(and (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {460#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:41,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {464#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:41,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-08 10:29:41,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 10:29:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:41,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:42,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-08 10:29:42,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {418#false} is VALID [2022-04-08 10:29:42,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {464#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:42,818 INFO L272 TraceCheckUtils]: 11: Hoare triple {480#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {460#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:42,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {480#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:42,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {484#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:29:42,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {488#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:29:42,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {496#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {492#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:29:42,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {496#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:29:42,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:42,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:42,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {417#true} #55#return; {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:42,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:42,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#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; {500#(not (= (mod (mod 6 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:42,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-08 10:29:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532412142] [2022-04-08 10:29:42,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97858859] [2022-04-08 10:29:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97858859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:42,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:42,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2022-04-08 10:29:42,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:42,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911039365] [2022-04-08 10:29:42,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911039365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:42,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:42,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:29:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224856223] [2022-04-08 10:29:42,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:42,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-08 10:29:42,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:42,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:42,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:42,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:29:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:29:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:29:42,856 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:43,083 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 10:29:43,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:29:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 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 15 [2022-04-08 10:29:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 10:29:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-08 10:29:43,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-08 10:29:43,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:43,121 INFO L225 Difference]: With dead ends: 23 [2022-04-08 10:29:43,121 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:29:43,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:29:43,122 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:43,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 35 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:29:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:29:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:29:43,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:43,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,126 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,126 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:43,128 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 10:29:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:29:43,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:43,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:43,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:29:43,129 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:29:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:43,130 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 10:29:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:29:43,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:43,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:43,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:43,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 10:29:43,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 10:29:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:43,132 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 10:29:43,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:43,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 10:29:43,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 10:29:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:29:43,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:43,151 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:43,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:43,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:43,356 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -723221701, now seen corresponding path program 5 times [2022-04-08 10:29:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902109592] [2022-04-08 10:29:43,366 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:43,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -723221701, now seen corresponding path program 6 times [2022-04-08 10:29:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230623188] [2022-04-08 10:29:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:43,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:43,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472704314] [2022-04-08 10:29:43,386 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:29:43,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:43,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:43,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:29:43,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 10:29:43,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:29:43,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:43,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:29:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:43,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:43,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {639#true} call ULTIMATE.init(); {639#true} is VALID [2022-04-08 10:29:43,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#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; {647#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:43,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {647#(= ~SIZE~0 20000001)} assume true; {647#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:43,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {647#(= ~SIZE~0 20000001)} {639#true} #55#return; {647#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:43,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {647#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {647#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:43,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {647#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {647#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:43,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {647#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {663#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:43,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {663#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {667#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:43,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {667#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {671#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:43,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {671#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {675#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:29:43,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {675#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {675#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:29:43,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume ~n~0 % 4294967296 > 0; {675#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:29:43,695 INFO L272 TraceCheckUtils]: 12: Hoare triple {675#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:43,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:43,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {640#false} is VALID [2022-04-08 10:29:43,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#false} assume !false; {640#false} is VALID [2022-04-08 10:29:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:43,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:44,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#false} assume !false; {640#false} is VALID [2022-04-08 10:29:44,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {640#false} is VALID [2022-04-08 10:29:44,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:44,382 INFO L272 TraceCheckUtils]: 12: Hoare triple {705#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:44,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {705#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:44,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {705#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {705#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:44,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {705#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:44,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {715#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} is VALID [2022-04-08 10:29:44,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {723#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {719#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} is VALID [2022-04-08 10:29:44,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {723#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} is VALID [2022-04-08 10:29:44,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:44,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:44,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {639#true} #55#return; {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:44,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:44,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#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; {727#(not (= (mod (mod 9 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:44,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {639#true} call ULTIMATE.init(); {639#true} is VALID [2022-04-08 10:29:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:44,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230623188] [2022-04-08 10:29:44,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472704314] [2022-04-08 10:29:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472704314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:44,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:44,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 10:29:44,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:44,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902109592] [2022-04-08 10:29:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902109592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:44,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:44,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:29:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660910892] [2022-04-08 10:29:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:44,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:44,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:44,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:29:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:29:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:29:44,433 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:44,653 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:29:44,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:29:44,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-08 10:29:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-08 10:29:44,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-08 10:29:44,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:44,686 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:29:44,687 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:29:44,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:29:44,688 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:44,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:29:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:29:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 10:29:44,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:44,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:44,692 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:44,692 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:44,693 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 10:29:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:29:44,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:44,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:44,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:29:44,694 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:29:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:44,695 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 10:29:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:29:44,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:44,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:44,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:44,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 10:29:44,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 10:29:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:44,697 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 10:29:44,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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-08 10:29:44,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 10:29:44,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 10:29:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:29:44,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:44,719 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:44,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:44,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:44,948 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash 580021722, now seen corresponding path program 7 times [2022-04-08 10:29:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935084998] [2022-04-08 10:29:44,951 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:44,951 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:44,951 INFO L85 PathProgramCache]: Analyzing trace with hash 580021722, now seen corresponding path program 8 times [2022-04-08 10:29:44,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:44,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232139408] [2022-04-08 10:29:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:44,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:44,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150910434] [2022-04-08 10:29:44,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:29:44,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:44,976 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-08 10:29:45,001 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-08 10:29:45,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:29:45,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:45,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:29:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:45,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:45,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2022-04-08 10:29:45,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#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; {880#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:45,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#(= ~SIZE~0 20000001)} assume true; {880#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:45,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#(= ~SIZE~0 20000001)} {872#true} #55#return; {880#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:45,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {880#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:45,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {880#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:45,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {896#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:45,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {896#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {900#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:45,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {904#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:45,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {904#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {908#(and (= 0 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:29:45,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {908#(and (= 0 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {912#(and (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 6)) (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:29:45,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#(and (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 6)) (+ main_~k~0 (- 6))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {916#(and (= main_~k~0 12) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:45,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {916#(and (= main_~k~0 12) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume ~n~0 % 4294967296 > 0; {916#(and (= main_~k~0 12) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:45,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {916#(and (= main_~k~0 12) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:45,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:45,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {873#false} is VALID [2022-04-08 10:29:45,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-08 10:29:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:45,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:48,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#false} assume !false; {873#false} is VALID [2022-04-08 10:29:48,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {873#false} is VALID [2022-04-08 10:29:48,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:48,551 INFO L272 TraceCheckUtils]: 13: Hoare triple {943#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:48,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {943#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {943#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:48,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {943#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:48,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {954#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {950#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:29:48,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {958#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {954#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-08 10:29:48,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {962#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {958#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:29:48,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {962#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:29:48,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {966#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:29:48,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:48,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:48,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {872#true} #55#return; {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:48,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:48,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {872#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; {970#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:48,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2022-04-08 10:29:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:48,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232139408] [2022-04-08 10:29:48,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150910434] [2022-04-08 10:29:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150910434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:48,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-08 10:29:48,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935084998] [2022-04-08 10:29:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935084998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:48,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:29:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588450149] [2022-04-08 10:29:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-08 10:29:48,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:48,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:48,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:29:48,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:48,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:29:48,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:29:48,604 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:48,861 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:29:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:29:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-08 10:29:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-08 10:29:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-04-08 10:29:48,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 25 transitions. [2022-04-08 10:29:48,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:48,902 INFO L225 Difference]: With dead ends: 25 [2022-04-08 10:29:48,902 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:29:48,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:29:48,903 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:48,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 45 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:29:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:29:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 10:29:48,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:48,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,908 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,908 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:48,909 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:29:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:29:48,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:48,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:48,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-08 10:29:48,910 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-08 10:29:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:48,911 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 10:29:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:29:48,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:48,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:48,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:48,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-08 10:29:48,913 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-08 10:29:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:48,913 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-08 10:29:48,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:48,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-08 10:29:48,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 10:29:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:29:48,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:48,933 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:48,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 10:29:49,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:49,140 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1969105125, now seen corresponding path program 9 times [2022-04-08 10:29:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730741367] [2022-04-08 10:29:49,143 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:49,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1969105125, now seen corresponding path program 10 times [2022-04-08 10:29:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:49,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305883546] [2022-04-08 10:29:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:49,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:49,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540172551] [2022-04-08 10:29:49,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:29:49,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:49,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:49,164 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-08 10:29:49,165 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-08 10:29:49,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:29:49,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:49,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:29:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:49,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:49,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1121#true} call ULTIMATE.init(); {1121#true} is VALID [2022-04-08 10:29:49,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {1121#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; {1129#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:49,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#(= ~SIZE~0 20000001)} assume true; {1129#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:49,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1129#(= ~SIZE~0 20000001)} {1121#true} #55#return; {1129#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:49,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {1129#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {1129#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:49,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {1129#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1129#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:49,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {1129#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1145#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:49,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1149#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:49,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1153#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:29:49,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {1153#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1157#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= (+ (- 9) main_~j~0) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:49,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {1157#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= (+ (- 9) main_~j~0) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1161#(and (= (+ (- 9) main_~i~0) (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~j~0 (- 12)) 0))} is VALID [2022-04-08 10:29:49,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#(and (= (+ (- 9) main_~i~0) (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~j~0 (- 12)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1165#(and (= (+ main_~i~0 (- 12)) 3) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:29:49,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(and (= (+ main_~i~0 (- 12)) 3) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1169#(and (= (+ main_~i~0 (- 12)) 3) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:29:49,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(and (= (+ main_~i~0 (- 12)) 3) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} assume ~n~0 % 4294967296 > 0; {1165#(and (= (+ main_~i~0 (- 12)) 3) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:29:49,777 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(and (= (+ main_~i~0 (- 12)) 3) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:49,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:49,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1122#false} is VALID [2022-04-08 10:29:49,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {1122#false} assume !false; {1122#false} is VALID [2022-04-08 10:29:49,778 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-08 10:29:49,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:52,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {1122#false} assume !false; {1122#false} is VALID [2022-04-08 10:29:52,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1122#false} is VALID [2022-04-08 10:29:52,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:52,132 INFO L272 TraceCheckUtils]: 14: Hoare triple {1196#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:52,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {1200#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {1196#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:52,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {1204#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1200#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:29:52,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1204#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:29:52,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {1212#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1208#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:29:52,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {1216#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1212#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:29:52,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1220#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1216#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:29:52,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {1224#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1220#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:29:52,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1224#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:29:52,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:52,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:52,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {1121#true} #55#return; {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:52,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:52,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {1121#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; {1228#(not (= (mod (mod 15 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:52,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {1121#true} call ULTIMATE.init(); {1121#true} is VALID [2022-04-08 10:29:52,150 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-08 10:29:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:52,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305883546] [2022-04-08 10:29:52,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:52,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540172551] [2022-04-08 10:29:52,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540172551] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:52,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:52,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2022-04-08 10:29:52,151 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:52,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730741367] [2022-04-08 10:29:52,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730741367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:52,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:52,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:29:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689735830] [2022-04-08 10:29:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:29:52,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:52,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:52,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:29:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:52,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:29:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:29:52,174 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:52,520 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 10:29:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:29:52,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-08 10:29:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-08 10:29:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-08 10:29:52,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-08 10:29:52,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:52,555 INFO L225 Difference]: With dead ends: 26 [2022-04-08 10:29:52,555 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 10:29:52,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:29:52,556 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:52,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:29:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 10:29:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 10:29:52,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:52,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,560 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,560 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:52,561 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:29:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:29:52,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:52,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:52,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 10:29:52,562 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 10:29:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:52,563 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:29:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:29:52,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:52,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:52,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:52,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-08 10:29:52,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-08 10:29:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:52,565 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-08 10:29:52,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:52,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-08 10:29:52,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 10:29:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:29:52,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:52,588 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:52,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 10:29:52,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:52,789 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:52,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash 612341242, now seen corresponding path program 11 times [2022-04-08 10:29:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:52,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645169879] [2022-04-08 10:29:52,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:52,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash 612341242, now seen corresponding path program 12 times [2022-04-08 10:29:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:52,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321036693] [2022-04-08 10:29:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:52,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:52,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056183164] [2022-04-08 10:29:52,821 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:29:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:52,823 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-08 10:29:52,854 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-08 10:29:52,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:29:52,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:52,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:29:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:52,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:53,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {1385#true} call ULTIMATE.init(); {1385#true} is VALID [2022-04-08 10:29:53,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#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; {1393#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:53,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#(= ~SIZE~0 20000001)} assume true; {1393#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:53,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#(= ~SIZE~0 20000001)} {1385#true} #55#return; {1393#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:53,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {1393#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:53,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1393#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:53,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {1393#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1409#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:53,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {1409#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1413#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:29:53,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1417#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:53,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1417#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1421#(and (= main_~i~0 main_~k~0) (= 0 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:53,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {1421#(and (= main_~i~0 main_~k~0) (= 0 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1425#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~j~0 (- 12)) 0))} is VALID [2022-04-08 10:29:53,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {1425#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~j~0 (- 12)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1429#(and (= (+ (- 15) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:29:53,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {1429#(and (= (+ (- 15) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1433#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:29:53,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1433#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:29:53,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {1433#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume ~n~0 % 4294967296 > 0; {1433#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:29:53,295 INFO L272 TraceCheckUtils]: 15: Hoare triple {1433#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {1443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:53,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {1443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:53,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1386#false} is VALID [2022-04-08 10:29:53,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-04-08 10:29:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:53,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:55,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-04-08 10:29:55,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {1447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1386#false} is VALID [2022-04-08 10:29:55,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {1443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:55,410 INFO L272 TraceCheckUtils]: 15: Hoare triple {1463#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {1443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:55,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1463#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {1463#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:55,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {1463#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1463#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:55,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {1473#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1463#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:29:55,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {1477#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1473#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} is VALID [2022-04-08 10:29:55,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {1481#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1477#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} is VALID [2022-04-08 10:29:55,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {1485#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1481#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} is VALID [2022-04-08 10:29:55,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1485#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} is VALID [2022-04-08 10:29:55,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {1493#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1489#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} is VALID [2022-04-08 10:29:55,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1493#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} is VALID [2022-04-08 10:29:55,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:55,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:55,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {1385#true} #55#return; {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:55,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:55,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#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; {1497#(not (= (mod (mod 18 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:29:55,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {1385#true} call ULTIMATE.init(); {1385#true} is VALID [2022-04-08 10:29:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:55,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321036693] [2022-04-08 10:29:55,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:29:55,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056183164] [2022-04-08 10:29:55,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056183164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:29:55,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:55,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-04-08 10:29:55,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:55,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645169879] [2022-04-08 10:29:55,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645169879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:55,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:55,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:29:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821857629] [2022-04-08 10:29:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:55,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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 19 [2022-04-08 10:29:55,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:55,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:55,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:29:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:29:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:29:55,456 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:55,806 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 10:29:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:29:55,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 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 19 [2022-04-08 10:29:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-04-08 10:29:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-04-08 10:29:55,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2022-04-08 10:29:55,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:55,843 INFO L225 Difference]: With dead ends: 27 [2022-04-08 10:29:55,844 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 10:29:55,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:29:55,847 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:55,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:29:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 10:29:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 10:29:55,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:55,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,856 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,856 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:55,857 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:29:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:29:55,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:55,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:55,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 10:29:55,858 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-08 10:29:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:55,858 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 10:29:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:29:55,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:55,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:55,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:55,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-08 10:29:55,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-08 10:29:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:55,860 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-08 10:29:55,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:55,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-08 10:29:55,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 10:29:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:29:55,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:55,882 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:55,889 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-08 10:29:56,089 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:56,090 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -967200005, now seen corresponding path program 13 times [2022-04-08 10:29:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:56,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385205041] [2022-04-08 10:29:56,093 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:56,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -967200005, now seen corresponding path program 14 times [2022-04-08 10:29:56,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:56,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962849683] [2022-04-08 10:29:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:56,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:29:56,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886383293] [2022-04-08 10:29:56,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:29:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:56,113 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-08 10:29:56,131 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-08 10:29:56,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:29:56,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:56,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 10:29:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:56,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:56,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2022-04-08 10:29:56,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1660#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; {1668#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:56,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1668#(= ~SIZE~0 20000001)} assume true; {1668#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:56,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1668#(= ~SIZE~0 20000001)} {1660#true} #55#return; {1668#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:56,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {1668#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {1668#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:56,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {1668#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1668#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:29:56,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {1668#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1684#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:29:56,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1684#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1688#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:29:56,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1688#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1692#(and (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6))} is VALID [2022-04-08 10:29:56,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#(and (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1696#(and (= 6 (+ main_~k~0 (- 3))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 10:29:56,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {1696#(and (= 6 (+ main_~k~0 (- 3))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1700#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:56,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1700#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1704#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:29:56,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {1704#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1708#(and (= (+ main_~j~0 (- 6)) 12) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:29:56,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {1708#(and (= (+ main_~j~0 (- 6)) 12) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1712#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:29:56,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1716#(and (= main_~i~0 21) (= main_~k~0 21) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:29:56,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {1716#(and (= main_~i~0 21) (= main_~k~0 21) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 21))} assume ~n~0 % 4294967296 > 0; {1712#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:29:56,664 INFO L272 TraceCheckUtils]: 16: Hoare triple {1712#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {1723#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:56,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {1723#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1727#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:56,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {1727#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1661#false} is VALID [2022-04-08 10:29:56,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2022-04-08 10:29:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:56,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:30:00,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2022-04-08 10:30:00,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {1727#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1661#false} is VALID [2022-04-08 10:30:00,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {1723#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1727#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:00,123 INFO L272 TraceCheckUtils]: 16: Hoare triple {1743#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {1723#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:00,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {1747#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {1743#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:00,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1751#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1747#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:30:00,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1755#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1751#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:00,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {1759#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1755#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:00,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1763#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1759#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:30:00,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {1767#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1763#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:30:00,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {1771#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1767#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:30:00,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1771#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:30:00,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {1779#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1775#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:30:00,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1779#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:00,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:00,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:00,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {1660#true} #55#return; {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:00,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:00,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1660#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; {1783#(not (= (mod (mod 21 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:00,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2022-04-08 10:30:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962849683] [2022-04-08 10:30:00,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:30:00,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886383293] [2022-04-08 10:30:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886383293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:30:00,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:30:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2022-04-08 10:30:00,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:30:00,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385205041] [2022-04-08 10:30:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385205041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:30:00,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:30:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:30:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740846622] [2022-04-08 10:30:00,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:30:00,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:30:00,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:30:00,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:00,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:30:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:30:00,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:30:00,176 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:00,614 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 10:30:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:30:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:30:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-08 10:30:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-08 10:30:00,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-08 10:30:00,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:00,652 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:30:00,652 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:30:00,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:30:00,653 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:00,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 50 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:30:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:30:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 10:30:00,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:00,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,659 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,659 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:00,660 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:30:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:30:00,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:00,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:00,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 22 states. [2022-04-08 10:30:00,661 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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 22 states. [2022-04-08 10:30:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:00,662 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 10:30:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:30:00,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:00,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:00,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:00,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 10:30:00,663 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-08 10:30:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:00,664 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 10:30:00,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:00,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 10:30:00,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 10:30:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:30:00,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:00,695 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:00,720 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-08 10:30:00,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 10:30:00,896 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1606628890, now seen corresponding path program 15 times [2022-04-08 10:30:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:00,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137631519] [2022-04-08 10:30:00,899 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:00,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1606628890, now seen corresponding path program 16 times [2022-04-08 10:30:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:00,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488408889] [2022-04-08 10:30:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:00,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:30:00,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294508136] [2022-04-08 10:30:00,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:30:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:00,929 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-08 10:30:00,934 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-08 10:30:01,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:30:01,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:30:01,015 WARN L261 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-08 10:30:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:01,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:30:01,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1952#true} is VALID [2022-04-08 10:30:01,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1952#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; {1960#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:01,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#(= ~SIZE~0 20000001)} assume true; {1960#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:01,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#(= ~SIZE~0 20000001)} {1952#true} #55#return; {1960#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:01,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {1960#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {1960#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:01,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1960#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:01,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {1960#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {1976#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:01,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {1976#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1980#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:01,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {1980#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1984#(and (= (+ main_~i~0 (- 3)) 3) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} is VALID [2022-04-08 10:30:01,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {1984#(and (= (+ main_~i~0 (- 3)) 3) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1988#(and (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-08 10:30:01,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {1988#(and (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1992#(and (= main_~j~0 12) (= main_~k~0 12) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 9))} is VALID [2022-04-08 10:30:01,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#(and (= main_~j~0 12) (= main_~k~0 12) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {1996#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:30:01,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {1996#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2000#(and (= (+ main_~j~0 (- 6)) 12) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:30:01,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#(and (= (+ main_~j~0 (- 6)) 12) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2004#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} is VALID [2022-04-08 10:30:01,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {2004#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2008#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24) (= (+ main_~i~0 (- 6)) 18))} is VALID [2022-04-08 10:30:01,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {2008#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24) (= (+ main_~i~0 (- 6)) 18))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2012#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24) (= (+ main_~i~0 (- 6)) 18))} is VALID [2022-04-08 10:30:01,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {2012#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24) (= (+ main_~i~0 (- 6)) 18))} assume ~n~0 % 4294967296 > 0; {2008#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24) (= (+ main_~i~0 (- 6)) 18))} is VALID [2022-04-08 10:30:01,537 INFO L272 TraceCheckUtils]: 17: Hoare triple {2008#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24) (= (+ main_~i~0 (- 6)) 18))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2019#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:01,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2023#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:01,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {2023#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1953#false} is VALID [2022-04-08 10:30:01,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2022-04-08 10:30:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:01,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:30:05,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2022-04-08 10:30:05,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {2023#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1953#false} is VALID [2022-04-08 10:30:05,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2023#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:05,748 INFO L272 TraceCheckUtils]: 17: Hoare triple {2039#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2019#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:05,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {2043#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {2039#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:05,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {2047#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2043#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:30:05,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {2051#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2047#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:05,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {2055#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2051#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:05,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {2059#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2055#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:30:05,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2059#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:30:05,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {2067#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2063#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:30:05,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {2071#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2067#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:30:05,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {2075#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2071#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:30:05,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {2079#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2075#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:05,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {2079#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:05,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:05,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:05,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {1952#true} #55#return; {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:05,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:05,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {1952#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; {2083#(not (= (mod (mod 24 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:05,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1952#true} is VALID [2022-04-08 10:30:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:05,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488408889] [2022-04-08 10:30:05,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:30:05,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294508136] [2022-04-08 10:30:05,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294508136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:30:05,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:30:05,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2022-04-08 10:30:05,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:30:05,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [137631519] [2022-04-08 10:30:05,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [137631519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:30:05,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:30:05,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:30:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508328543] [2022-04-08 10:30:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:30:05,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:30:05,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:30:05,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:05,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:05,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:30:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:05,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:30:05,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:30:05,803 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:06,386 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 10:30:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:30:06,386 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:30:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-08 10:30:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-08 10:30:06,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-08 10:30:06,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:06,428 INFO L225 Difference]: With dead ends: 29 [2022-04-08 10:30:06,428 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:30:06,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:30:06,429 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:06,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:30:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:30:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 10:30:06,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:06,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,433 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,433 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:06,434 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 10:30:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 10:30:06,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:06,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:06,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-08 10:30:06,435 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 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-08 10:30:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:06,436 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 10:30:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 10:30:06,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:06,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:06,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:06,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-08 10:30:06,437 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-08 10:30:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:06,437 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-08 10:30:06,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:06,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-08 10:30:06,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 10:30:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:30:06,469 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:06,470 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:06,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 10:30:06,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:06,670 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash -209053989, now seen corresponding path program 17 times [2022-04-08 10:30:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:06,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060135747] [2022-04-08 10:30:06,674 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:06,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash -209053989, now seen corresponding path program 18 times [2022-04-08 10:30:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:06,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955800922] [2022-04-08 10:30:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:06,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:30:06,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756504357] [2022-04-08 10:30:06,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:30:06,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:06,693 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-08 10:30:06,725 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-08 10:30:06,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:30:06,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:30:06,922 WARN L261 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-08 10:30:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:06,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:30:07,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2022-04-08 10:30:07,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#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; {2266#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:07,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {2266#(= ~SIZE~0 20000001)} assume true; {2266#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:07,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2266#(= ~SIZE~0 20000001)} {2258#true} #55#return; {2266#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:07,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {2266#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {2266#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:07,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {2266#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2266#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:07,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {2266#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {2282#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:07,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {2282#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2286#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:30:07,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {2286#(and (= (+ main_~j~0 (- 3)) 0) (= main_~k~0 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2290#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-08 10:30:07,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {2290#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2294#(and (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-08 10:30:07,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {2294#(and (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2298#(and (= main_~j~0 12) (= 9 (+ main_~k~0 (- 3))) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:07,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(and (= main_~j~0 12) (= 9 (+ main_~k~0 (- 3))) (= main_~i~0 12) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2302#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= main_~k~0 15))} is VALID [2022-04-08 10:30:07,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {2302#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= main_~k~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2306#(and (= 15 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 15) (= main_~j~0 18) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:07,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {2306#(and (= 15 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 15) (= main_~j~0 18) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2310#(and (= main_~k~0 21) (= (+ main_~i~0 (- 6)) 15) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:30:07,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {2310#(and (= main_~k~0 21) (= (+ main_~i~0 (- 6)) 15) (= ~SIZE~0 20000001) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2314#(and (= (+ main_~j~0 (- 3)) 21) (< 21 (mod main_~n~0 4294967296)) (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~k~0 24))} is VALID [2022-04-08 10:30:07,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {2314#(and (= (+ main_~j~0 (- 3)) 21) (< 21 (mod main_~n~0 4294967296)) (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2318#(and (= main_~j~0 27) (= main_~i~0 27) (< 21 (mod main_~n~0 4294967296)) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:07,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {2318#(and (= main_~j~0 27) (= main_~i~0 27) (< 21 (mod main_~n~0 4294967296)) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2322#(and (= main_~j~0 27) (= main_~i~0 27) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:07,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {2322#(and (= main_~j~0 27) (= main_~i~0 27) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume ~n~0 % 4294967296 > 0; {2322#(and (= main_~j~0 27) (= main_~i~0 27) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:07,483 INFO L272 TraceCheckUtils]: 18: Hoare triple {2322#(and (= main_~j~0 27) (= main_~i~0 27) (= main_~k~0 27) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:07,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:07,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {2333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2259#false} is VALID [2022-04-08 10:30:07,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-08 10:30:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:07,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:30:14,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-08 10:30:14,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {2333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2259#false} is VALID [2022-04-08 10:30:14,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {2329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:14,197 INFO L272 TraceCheckUtils]: 18: Hoare triple {2349#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:14,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {2349#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {2349#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:14,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {2356#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2349#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:14,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {2360#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2356#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:30:14,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {2364#(or (<= 0 (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2360#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-08 10:30:14,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {2368#(or (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))) (<= 0 (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2364#(or (<= 0 (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:30:14,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {2372#(or (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))) (<= 0 (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2368#(or (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))) (<= 0 (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) 4294967296)))} is VALID [2022-04-08 10:30:14,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {2376#(or (<= 0 (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2372#(or (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))) (<= 0 (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) 4294967296)))} is VALID [2022-04-08 10:30:14,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {2380#(or (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2376#(or (<= 0 (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:30:14,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2384#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2380#(or (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:30:14,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {2388#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 18) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2384#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:14,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {2392#(or (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))) (<= 0 (div (+ (mod (+ main_~i~0 21) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2388#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 18) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:14,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {2392#(or (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))) (<= 0 (div (+ (mod (+ main_~i~0 21) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) 4294967296)))} is VALID [2022-04-08 10:30:14,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:14,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:14,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {2258#true} #55#return; {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:14,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:14,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#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; {2396#(not (= (mod (mod 27 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:14,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2022-04-08 10:30:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:14,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955800922] [2022-04-08 10:30:14,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:30:14,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756504357] [2022-04-08 10:30:14,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756504357] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:30:14,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:30:14,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-04-08 10:30:14,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:30:14,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060135747] [2022-04-08 10:30:14,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060135747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:30:14,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:30:14,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:30:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346912365] [2022-04-08 10:30:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:30:14,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-08 10:30:14,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:30:14,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:14,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:30:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:14,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:30:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:30:14,263 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:14,848 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 10:30:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:30:14,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 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 22 [2022-04-08 10:30:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-08 10:30:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-08 10:30:14,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 30 transitions. [2022-04-08 10:30:14,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:14,891 INFO L225 Difference]: With dead ends: 30 [2022-04-08 10:30:14,891 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:30:14,892 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:30:14,892 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:14,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 60 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:30:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:30:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 10:30:14,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:14,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,897 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,898 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:14,899 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:30:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 10:30:14,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:14,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:14,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 10:30:14,899 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 10:30:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:14,900 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 10:30:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 10:30:14,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:14,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:14,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:14,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 10:30:14,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-08 10:30:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:14,902 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 10:30:14,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:14,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 10:30:14,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 10:30:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:30:14,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:14,942 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:14,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:30:15,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 10:30:15,143 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash -660648390, now seen corresponding path program 19 times [2022-04-08 10:30:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:15,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [571051683] [2022-04-08 10:30:15,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:15,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -660648390, now seen corresponding path program 20 times [2022-04-08 10:30:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:15,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313006315] [2022-04-08 10:30:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:15,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:30:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986146130] [2022-04-08 10:30:15,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:30:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:15,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:30:15,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 10:30:15,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:30:15,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:30:15,259 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-08 10:30:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:15,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:30:15,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {2577#true} call ULTIMATE.init(); {2577#true} is VALID [2022-04-08 10:30:15,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {2577#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; {2585#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:15,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {2585#(= ~SIZE~0 20000001)} assume true; {2585#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:15,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2585#(= ~SIZE~0 20000001)} {2577#true} #55#return; {2585#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:15,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2585#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {2585#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:15,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {2585#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2585#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:15,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {2585#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {2601#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:15,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {2601#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2605#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:30:15,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {2605#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2609#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-08 10:30:15,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2609#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2613#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:30:15,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {2613#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2617#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:15,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {2617#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2621#(and (= (+ (- 15) main_~i~0) 0) (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:15,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {2621#(and (= (+ (- 15) main_~i~0) 0) (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2625#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:30:15,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2629#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= main_~j~0 21))} is VALID [2022-04-08 10:30:15,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2633#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~k~0 24))} is VALID [2022-04-08 10:30:15,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {2633#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2637#(and (= main_~i~0 27) (= (+ main_~j~0 (- 6)) 21) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:15,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {2637#(and (= main_~i~0 27) (= (+ main_~j~0 (- 6)) 21) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2641#(and (= (+ main_~i~0 (- 3)) 27) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} is VALID [2022-04-08 10:30:15,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {2641#(and (= (+ main_~i~0 (- 3)) 27) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2645#(and (= (+ main_~i~0 (- 3)) 27) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} is VALID [2022-04-08 10:30:15,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {2645#(and (= (+ main_~i~0 (- 3)) 27) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} assume ~n~0 % 4294967296 > 0; {2641#(and (= (+ main_~i~0 (- 3)) 27) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} is VALID [2022-04-08 10:30:15,816 INFO L272 TraceCheckUtils]: 19: Hoare triple {2641#(and (= (+ main_~i~0 (- 3)) 27) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:15,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {2652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:15,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {2656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2578#false} is VALID [2022-04-08 10:30:15,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {2578#false} assume !false; {2578#false} is VALID [2022-04-08 10:30:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:15,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:30:22,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {2578#false} assume !false; {2578#false} is VALID [2022-04-08 10:30:22,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {2656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2578#false} is VALID [2022-04-08 10:30:22,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {2652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:22,781 INFO L272 TraceCheckUtils]: 19: Hoare triple {2672#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:22,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {2676#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {2672#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:22,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {2680#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2676#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:30:22,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2680#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:22,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {2688#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2684#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:22,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2692#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2688#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:30:22,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2696#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2692#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:30:22,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {2700#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2696#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:30:22,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {2704#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2700#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:30:22,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2708#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2704#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:30:22,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2708#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:22,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2716#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2712#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:22,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {2720#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2716#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:30:22,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {2720#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:30:22,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:22,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:22,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {2577#true} #55#return; {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:22,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:22,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {2577#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; {2724#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:22,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {2577#true} call ULTIMATE.init(); {2577#true} is VALID [2022-04-08 10:30:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313006315] [2022-04-08 10:30:22,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:30:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986146130] [2022-04-08 10:30:22,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986146130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:30:22,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:30:22,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2022-04-08 10:30:22,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:30:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [571051683] [2022-04-08 10:30:22,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [571051683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:30:22,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:30:22,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:30:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195675734] [2022-04-08 10:30:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:30:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-08 10:30:22,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:30:22,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:22,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:22,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:30:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:30:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:30:22,859 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:23,581 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 10:30:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:30:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-08 10:30:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-08 10:30:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-08 10:30:23,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-08 10:30:23,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:23,636 INFO L225 Difference]: With dead ends: 31 [2022-04-08 10:30:23,636 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 10:30:23,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:30:23,637 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:23,637 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 60 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:30:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 10:30:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 10:30:23,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:23,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,646 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,647 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:23,648 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:30:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:30:23,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:23,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:23,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-08 10:30:23,649 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-08 10:30:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:23,650 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 10:30:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:30:23,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:23,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:23,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:23,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 10:30:23,651 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-08 10:30:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:23,652 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 10:30:23,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:23,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 10:30:23,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 10:30:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:30:23,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:23,696 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:23,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 10:30:23,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 10:30:23,897 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1775172933, now seen corresponding path program 21 times [2022-04-08 10:30:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:23,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322680182] [2022-04-08 10:30:23,900 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:23,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1775172933, now seen corresponding path program 22 times [2022-04-08 10:30:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:23,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207276122] [2022-04-08 10:30:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:23,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:30:23,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469548155] [2022-04-08 10:30:23,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:30:23,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:23,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:23,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:30:23,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 10:30:24,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:30:24,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:30:24,039 WARN L261 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-08 10:30:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:24,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:30:24,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {2911#true} call ULTIMATE.init(); {2911#true} is VALID [2022-04-08 10:30:24,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#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; {2919#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:24,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#(= ~SIZE~0 20000001)} assume true; {2919#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:24,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#(= ~SIZE~0 20000001)} {2911#true} #55#return; {2919#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:24,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {2919#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:24,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2919#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:24,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {2919#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {2935#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:24,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2935#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2939#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:30:24,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {2939#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2943#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:30:24,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {2943#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2947#(and (= (+ (- 9) main_~j~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:24,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {2947#(and (= (+ (- 9) main_~j~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2951#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 12)) 0))} is VALID [2022-04-08 10:30:24,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {2951#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 12)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2955#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= main_~k~0 15))} is VALID [2022-04-08 10:30:24,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= main_~k~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2959#(and (= 15 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 15) (= (+ main_~j~0 (- 3)) 15) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:24,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {2959#(and (= 15 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 15) (= (+ main_~j~0 (- 3)) 15) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2963#(and (= main_~i~0 21) (= (+ main_~j~0 (- 6)) 15) (= main_~k~0 21) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:24,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {2963#(and (= main_~i~0 21) (= (+ main_~j~0 (- 6)) 15) (= main_~k~0 21) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2967#(and (= 15 (+ (- 9) main_~j~0)) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:30:24,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {2967#(and (= 15 (+ (- 9) main_~j~0)) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2971#(and (= 21 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 24) (= (+ main_~j~0 (- 12)) 15) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:24,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {2971#(and (= 21 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 24) (= (+ main_~j~0 (- 12)) 15) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2975#(and (= 21 (+ (- 9) main_~k~0)) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 15 (+ (- 15) main_~j~0)))} is VALID [2022-04-08 10:30:24,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {2975#(and (= 21 (+ (- 9) main_~k~0)) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 15 (+ (- 15) main_~j~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {2979#(and (= (+ main_~k~0 (- 12)) 21) (= (+ main_~j~0 (- 18)) 15) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:30:24,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {2979#(and (= (+ main_~k~0 (- 12)) 21) (= (+ main_~j~0 (- 18)) 15) (= ~SIZE~0 20000001) (= main_~i~0 33))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {2983#(and (= (+ main_~k~0 (- 12)) 21) (= (+ main_~j~0 (- 18)) 15) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:30:24,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {2983#(and (= (+ main_~k~0 (- 12)) 21) (= (+ main_~j~0 (- 18)) 15) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~i~0 33))} assume ~n~0 % 4294967296 > 0; {2979#(and (= (+ main_~k~0 (- 12)) 21) (= (+ main_~j~0 (- 18)) 15) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:30:24,693 INFO L272 TraceCheckUtils]: 20: Hoare triple {2979#(and (= (+ main_~k~0 (- 12)) 21) (= (+ main_~j~0 (- 18)) 15) (= ~SIZE~0 20000001) (= main_~i~0 33))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2990#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:24,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {2990#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2994#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:24,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {2994#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2912#false} is VALID [2022-04-08 10:30:24,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {2912#false} assume !false; {2912#false} is VALID [2022-04-08 10:30:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:24,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:30:32,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2912#false} assume !false; {2912#false} is VALID [2022-04-08 10:30:32,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {2994#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2912#false} is VALID [2022-04-08 10:30:32,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {2990#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2994#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:32,556 INFO L272 TraceCheckUtils]: 20: Hoare triple {3010#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {2990#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:32,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {3014#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {3010#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:32,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {3018#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {3014#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:30:32,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {3022#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3018#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:32,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {3026#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3022#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:32,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {3030#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3026#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:30:32,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {3034#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3030#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:30:32,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {3038#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3034#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:30:32,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {3042#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3038#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:30:32,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {3046#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3042#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:30:32,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {3050#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3046#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:32,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {3054#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3050#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:32,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {3058#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3054#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:30:32,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {3062#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3058#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:30:32,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {3062#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:32,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:32,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:32,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {2911#true} #55#return; {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:32,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:32,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#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; {3066#(not (= (mod (mod 33 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:32,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {2911#true} call ULTIMATE.init(); {2911#true} is VALID [2022-04-08 10:30:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207276122] [2022-04-08 10:30:32,603 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:30:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469548155] [2022-04-08 10:30:32,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469548155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:30:32,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:30:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2022-04-08 10:30:32,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:30:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322680182] [2022-04-08 10:30:32,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322680182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:30:32,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:30:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:30:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180879409] [2022-04-08 10:30:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:30:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 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) Word has length 24 [2022-04-08 10:30:32,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:30:32,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:32,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:32,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:30:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:32,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:30:32,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:30:32,640 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:33,689 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 10:30:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:30:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 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) Word has length 24 [2022-04-08 10:30:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-08 10:30:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-08 10:30:33,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-08 10:30:33,746 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-08 10:30:33,746 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:30:33,747 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:30:33,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:30:33,748 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:33,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 70 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:30:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:30:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 10:30:33,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:33,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,753 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,753 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:33,754 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 10:30:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 10:30:33,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:33,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:33,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 26 states. [2022-04-08 10:30:33,755 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 26 states. [2022-04-08 10:30:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:33,756 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 10:30:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 10:30:33,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:33,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:33,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:33,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-08 10:30:33,757 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-08 10:30:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:33,757 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-08 10:30:33,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:33,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-08 10:30:33,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 10:30:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:30:33,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:33,805 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:33,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 10:30:34,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 10:30:34,006 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1965695398, now seen corresponding path program 23 times [2022-04-08 10:30:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:34,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971477650] [2022-04-08 10:30:34,009 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:34,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1965695398, now seen corresponding path program 24 times [2022-04-08 10:30:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:34,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161593283] [2022-04-08 10:30:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:34,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:30:34,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799291005] [2022-04-08 10:30:34,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:30:34,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:34,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:34,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:30:34,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 10:30:34,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:30:34,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:30:34,317 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-08 10:30:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:34,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:30:34,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3259#true} is VALID [2022-04-08 10:30:34,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {3259#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; {3267#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:34,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#(= ~SIZE~0 20000001)} assume true; {3267#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:34,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3267#(= ~SIZE~0 20000001)} {3259#true} #55#return; {3267#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:34,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {3267#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {3267#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:34,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {3267#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3267#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:34,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {3267#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {3283#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:34,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {3283#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3287#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:34,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {3287#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3291#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} is VALID [2022-04-08 10:30:34,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {3291#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3295#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-08 10:30:34,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {3295#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3299#(and (= 9 (+ main_~k~0 (- 3))) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-08 10:30:34,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {3299#(and (= 9 (+ main_~k~0 (- 3))) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3303#(and (= 6 (+ (- 9) main_~j~0)) (= 9 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-08 10:30:34,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(and (= 6 (+ (- 9) main_~j~0)) (= 9 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3307#(and (= (+ main_~i~0 (- 6)) 12) (= main_~j~0 18) (= ~SIZE~0 20000001) (= 9 (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:30:34,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {3307#(and (= (+ main_~i~0 (- 6)) 12) (= main_~j~0 18) (= ~SIZE~0 20000001) (= 9 (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3311#(and (= main_~k~0 21) (= (+ (- 9) main_~i~0) 12) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:30:34,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {3311#(and (= main_~k~0 21) (= (+ (- 9) main_~i~0) 12) (= ~SIZE~0 20000001) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3315#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:30:34,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {3315#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3319#(and (= (+ main_~j~0 (- 6)) 21) (= (+ main_~i~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:34,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {3319#(and (= (+ main_~j~0 (- 6)) 21) (= (+ main_~i~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3323#(and (= 30 main_~i~0) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:30:34,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {3323#(and (= 30 main_~i~0) (= 21 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3327#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:34,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {3327#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3331#(and (= (+ main_~j~0 (- 3)) 33) (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:30:34,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {3331#(and (= (+ main_~j~0 (- 3)) 33) (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {3335#(and (= (+ main_~j~0 (- 3)) 33) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:30:34,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(and (= (+ main_~j~0 (- 3)) 33) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} assume ~n~0 % 4294967296 > 0; {3331#(and (= (+ main_~j~0 (- 3)) 33) (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:30:34,945 INFO L272 TraceCheckUtils]: 21: Hoare triple {3331#(and (= (+ main_~j~0 (- 3)) 33) (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {3342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:34,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {3342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:34,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {3346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3260#false} is VALID [2022-04-08 10:30:34,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2022-04-08 10:30:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:34,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:30:45,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {3260#false} assume !false; {3260#false} is VALID [2022-04-08 10:30:45,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {3346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3260#false} is VALID [2022-04-08 10:30:45,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {3342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:45,281 INFO L272 TraceCheckUtils]: 21: Hoare triple {3362#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {3342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:45,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {3366#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {3362#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:30:45,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {3370#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {3366#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:30:45,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {3374#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3370#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:45,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {3378#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3374#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:45,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {3382#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3378#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:30:45,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {3386#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3382#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:30:45,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {3390#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3386#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:30:45,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {3394#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3390#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:30:45,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {3398#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3394#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:30:45,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {3402#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3398#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:45,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {3406#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3402#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:45,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {3410#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3406#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:30:45,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {3414#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3410#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:30:45,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {3418#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3414#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:30:45,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {3418#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:30:45,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:45,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:45,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {3259#true} #55#return; {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:45,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:45,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {3259#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; {3422#(not (= (mod (mod 36 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:30:45,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {3259#true} call ULTIMATE.init(); {3259#true} is VALID [2022-04-08 10:30:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161593283] [2022-04-08 10:30:45,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:30:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799291005] [2022-04-08 10:30:45,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799291005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:30:45,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:30:45,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 35 [2022-04-08 10:30:45,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:30:45,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971477650] [2022-04-08 10:30:45,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971477650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:30:45,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:30:45,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:30:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680745129] [2022-04-08 10:30:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:30:45,347 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:30:45,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:30:45,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:45,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:45,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:30:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:30:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:30:45,383 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:46,567 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 10:30:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:30:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:30:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-08 10:30:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-08 10:30:46,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-08 10:30:46,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:46,624 INFO L225 Difference]: With dead ends: 33 [2022-04-08 10:30:46,624 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 10:30:46,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:30:46,625 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:46,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:30:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 10:30:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 10:30:46,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:46,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,636 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,636 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:46,637 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 10:30:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 10:30:46,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:46,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:46,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 27 states. [2022-04-08 10:30:46,638 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 27 states. [2022-04-08 10:30:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:46,639 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 10:30:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 10:30:46,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:46,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:46,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:46,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-08 10:30:46,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-08 10:30:46,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:46,640 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-08 10:30:46,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:30:46,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-08 10:30:46,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 10:30:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:30:46,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:46,699 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:46,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 10:30:46,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:30:46,900 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:46,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash 718042779, now seen corresponding path program 25 times [2022-04-08 10:30:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:46,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650559474] [2022-04-08 10:30:46,903 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:46,903 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 718042779, now seen corresponding path program 26 times [2022-04-08 10:30:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:46,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332522508] [2022-04-08 10:30:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:46,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:30:46,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603115163] [2022-04-08 10:30:46,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:30:46,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:46,920 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:30:46,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 10:30:47,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:30:47,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:30:47,050 WARN L261 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 10:30:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:47,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:30:47,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {3621#true} call ULTIMATE.init(); {3621#true} is VALID [2022-04-08 10:30:47,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {3621#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; {3629#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:47,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {3629#(= ~SIZE~0 20000001)} assume true; {3629#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:47,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3629#(= ~SIZE~0 20000001)} {3621#true} #55#return; {3629#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:47,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {3629#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {3629#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:47,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {3629#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3629#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:30:47,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {3629#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {3645#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:30:47,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {3645#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3649#(and (= main_~i~0 main_~j~0) (= main_~k~0 3) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:47,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {3649#(and (= main_~i~0 main_~j~0) (= main_~k~0 3) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3653#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-08 10:30:47,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {3653#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3657#(and (= (+ (- 9) main_~j~0) 0) (= main_~i~0 main_~j~0) (= 6 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:47,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {3657#(and (= (+ (- 9) main_~j~0) 0) (= main_~i~0 main_~j~0) (= 6 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3661#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:47,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {3661#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3665#(and (= (+ main_~j~0 (- 3)) 12) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-08 10:30:47,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {3665#(and (= (+ main_~j~0 (- 3)) 12) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3669#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:30:47,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {3669#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3673#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 18))} is VALID [2022-04-08 10:30:47,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {3673#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3677#(and (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 18) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} is VALID [2022-04-08 10:30:47,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {3677#(and (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 18) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3681#(and (= main_~j~0 27) (= (+ main_~k~0 (- 3)) 24) (= (+ main_~i~0 (- 6)) 21) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:30:47,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#(and (= main_~j~0 27) (= (+ main_~k~0 (- 3)) 24) (= (+ main_~i~0 (- 6)) 21) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3685#(and (= 30 main_~j~0) (= 30 main_~i~0) (< 24 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:30:47,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {3685#(and (= 30 main_~j~0) (= 30 main_~i~0) (< 24 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3689#(and (= main_~k~0 33) (= (+ main_~j~0 (- 3)) 30) (< 24 (mod main_~n~0 4294967296)) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:47,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {3689#(and (= main_~k~0 33) (= (+ main_~j~0 (- 3)) 30) (< 24 (mod main_~n~0 4294967296)) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3693#(and (< 24 (mod main_~n~0 4294967296)) (= (+ main_~k~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} is VALID [2022-04-08 10:30:47,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {3693#(and (< 24 (mod main_~n~0 4294967296)) (= (+ main_~k~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3697#(and (= (+ main_~j~0 (- 3)) 36) (< 24 (mod main_~n~0 4294967296)) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (= 33 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:30:47,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {3697#(and (= (+ main_~j~0 (- 3)) 36) (< 24 (mod main_~n~0 4294967296)) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (= 33 (+ main_~k~0 (- 6))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {3701#(and (= (+ main_~j~0 (- 3)) 36) (< 24 (mod main_~n~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (= 33 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:30:47,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {3701#(and (= (+ main_~j~0 (- 3)) 36) (< 24 (mod main_~n~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (= 33 (+ main_~k~0 (- 6))))} assume ~n~0 % 4294967296 > 0; {3705#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:30:47,759 INFO L272 TraceCheckUtils]: 22: Hoare triple {3705#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {3709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:30:47,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {3709#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:30:47,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {3713#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3622#false} is VALID [2022-04-08 10:30:47,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {3622#false} assume !false; {3622#false} is VALID [2022-04-08 10:30:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:30:47,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:31:00,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {3622#false} assume !false; {3622#false} is VALID [2022-04-08 10:31:00,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {3713#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3622#false} is VALID [2022-04-08 10:31:00,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {3709#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3713#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:31:00,417 INFO L272 TraceCheckUtils]: 22: Hoare triple {3729#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {3709#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:31:00,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {3733#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {3729#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:31:00,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {3737#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {3733#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:31:00,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {3741#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3737#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:31:00,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {3745#(or (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3741#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:31:00,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {3749#(or (< (mod (+ main_~i~0 9) 4294967296) (mod main_~n~0 4294967296)) (not (< 0 (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3745#(or (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:31:00,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {3753#(or (< (mod (+ main_~i~0 12) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3749#(or (< (mod (+ main_~i~0 9) 4294967296) (mod main_~n~0 4294967296)) (not (< 0 (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:31:00,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {3757#(or (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (mod main_~i~0 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3753#(or (< (mod (+ main_~i~0 12) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:31:00,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {3761#(or (<= 0 (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 18) 4294967296))) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3757#(or (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:00,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {3765#(or (<= 0 (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 21) 4294967296))) 4294967296)) (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3761#(or (<= 0 (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 18) 4294967296))) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:31:00,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {3769#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 9) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3765#(or (<= 0 (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 21) 4294967296))) 4294967296)) (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} is VALID [2022-04-08 10:31:00,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {3773#(or (<= 0 (div (+ (* (mod (+ main_~i~0 27) 4294967296) (- 1)) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3769#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 9) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:00,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {3777#(or (<= 0 (div (+ (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3773#(or (<= 0 (div (+ (* (mod (+ main_~i~0 27) 4294967296) (- 1)) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:31:00,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ main_~i~0 18) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3777#(or (<= 0 (div (+ (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:31:00,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {3785#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3781#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ main_~i~0 18) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:00,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {3789#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {3785#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:00,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {3789#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:00,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:00,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:00,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {3621#true} #55#return; {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:00,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:00,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {3621#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; {3793#(not (= (mod (mod 39 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:00,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {3621#true} call ULTIMATE.init(); {3621#true} is VALID [2022-04-08 10:31:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:31:00,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332522508] [2022-04-08 10:31:00,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:31:00,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603115163] [2022-04-08 10:31:00,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603115163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:31:00,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:31:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2022-04-08 10:31:00,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:31:00,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650559474] [2022-04-08 10:31:00,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650559474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:00,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:00,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:31:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939187308] [2022-04-08 10:31:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:31:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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 26 [2022-04-08 10:31:00,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:31:00,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:00,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:00,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:31:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:00,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:31:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1040, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:31:00,571 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:02,170 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 10:31:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:31:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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 26 [2022-04-08 10:31:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:31:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-08 10:31:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-08 10:31:02,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-08 10:31:02,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:02,233 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:31:02,233 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:31:02,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:31:02,234 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:31:02,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 74 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:31:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:31:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 10:31:02,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:31:02,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-08 10:31:02,242 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-08 10:31:02,242 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-08 10:31:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:02,242 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 10:31:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 10:31:02,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:02,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:02,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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 28 states. [2022-04-08 10:31:02,243 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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 28 states. [2022-04-08 10:31:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:02,244 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 10:31:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 10:31:02,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:02,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:02,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:31:02,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:31:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-08 10:31:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-08 10:31:02,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-08 10:31:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:31:02,245 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-08 10:31:02,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:02,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-08 10:31:02,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 10:31:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:31:02,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:31:02,301 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:31:02,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 10:31:02,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:31:02,502 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:31:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:31:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1985419654, now seen corresponding path program 27 times [2022-04-08 10:31:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:02,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936557987] [2022-04-08 10:31:02,505 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:31:02,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:31:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1985419654, now seen corresponding path program 28 times [2022-04-08 10:31:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:31:02,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945034316] [2022-04-08 10:31:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:31:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:31:02,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:31:02,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960526600] [2022-04-08 10:31:02,530 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:31:02,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:31:02,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:31:02,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:31:02,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 10:31:02,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:31:02,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:31:02,924 WARN L261 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-08 10:31:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:02,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:31:03,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {3998#true} call ULTIMATE.init(); {3998#true} is VALID [2022-04-08 10:31:03,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {3998#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; {4006#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:03,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {4006#(= ~SIZE~0 20000001)} assume true; {4006#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:03,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4006#(= ~SIZE~0 20000001)} {3998#true} #55#return; {4006#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:03,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {4006#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {4006#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:03,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {4006#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4006#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:03,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {4006#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {4022#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:31:03,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {4022#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4026#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:31:03,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {4026#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4030#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:31:03,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {4030#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4034#(and (= 3 (+ main_~k~0 (- 6))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 10:31:03,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {4034#(and (= 3 (+ main_~k~0 (- 6))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4038#(and (= main_~j~0 12) (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (= 3 (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:31:03,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {4038#(and (= main_~j~0 12) (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (= 3 (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4042#(and (= 6 (+ (- 9) main_~i~0)) (= (+ main_~k~0 (- 12)) 3) (= ~SIZE~0 20000001) (= main_~j~0 15))} is VALID [2022-04-08 10:31:03,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(and (= 6 (+ (- 9) main_~i~0)) (= (+ main_~k~0 (- 12)) 3) (= ~SIZE~0 20000001) (= main_~j~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4046#(and (= (+ main_~j~0 (- 3)) 15) (= (+ (- 15) main_~k~0) 3) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:31:03,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {4046#(and (= (+ main_~j~0 (- 3)) 15) (= (+ (- 15) main_~k~0) 3) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4050#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} is VALID [2022-04-08 10:31:03,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {4050#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4054#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:31:03,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {4054#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4058#(and (= main_~j~0 27) (= (+ main_~i~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:31:03,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {4058#(and (= main_~j~0 27) (= (+ main_~i~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4062#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} is VALID [2022-04-08 10:31:03,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {4062#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4066#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:31:03,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {4066#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4070#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} is VALID [2022-04-08 10:31:03,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {4070#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4074#(and (= main_~j~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 36))} is VALID [2022-04-08 10:31:03,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {4074#(and (= main_~j~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4078#(and (= ~SIZE~0 20000001) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:31:03,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {4078#(and (= ~SIZE~0 20000001) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {4082#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:31:03,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {4082#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} assume ~n~0 % 4294967296 > 0; {4078#(and (= ~SIZE~0 20000001) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:31:03,642 INFO L272 TraceCheckUtils]: 23: Hoare triple {4078#(and (= ~SIZE~0 20000001) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {4089#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:31:03,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {4089#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4093#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:31:03,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {4093#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3999#false} is VALID [2022-04-08 10:31:03,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {3999#false} assume !false; {3999#false} is VALID [2022-04-08 10:31:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:03,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:31:19,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {3999#false} assume !false; {3999#false} is VALID [2022-04-08 10:31:19,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {4093#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3999#false} is VALID [2022-04-08 10:31:19,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {4089#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4093#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:31:19,786 INFO L272 TraceCheckUtils]: 23: Hoare triple {4109#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {4089#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:31:19,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {4113#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {4109#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:31:19,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {4117#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {4113#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:31:19,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {4121#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4117#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:19,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {4125#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4121#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:19,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {4129#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4125#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:31:19,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {4133#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4129#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:31:19,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {4137#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4133#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:31:19,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {4141#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4137#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:31:19,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {4145#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4141#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:31:19,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4145#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:19,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {4153#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4149#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:19,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {4157#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4153#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:31:19,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {4161#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4157#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:31:19,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {4165#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4161#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:19,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {4169#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4165#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:31:19,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {4173#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4169#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:31:19,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {4173#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:31:19,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:19,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:19,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {3998#true} #55#return; {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:19,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:19,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {3998#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; {4177#(not (= (mod (mod 42 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:31:19,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {3998#true} call ULTIMATE.init(); {3998#true} is VALID [2022-04-08 10:31:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:31:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945034316] [2022-04-08 10:31:19,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:31:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960526600] [2022-04-08 10:31:19,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960526600] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:31:19,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:31:19,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2022-04-08 10:31:19,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:31:19,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936557987] [2022-04-08 10:31:19,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936557987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:19,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:19,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:31:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198396548] [2022-04-08 10:31:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:31:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-08 10:31:19,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:31:19,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:19,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:19,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:31:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:31:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1100, Unknown=1, NotChecked=0, Total=1482 [2022-04-08 10:31:19,929 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:23,070 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 10:31:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:31:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 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 27 [2022-04-08 10:31:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:31:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-08 10:31:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-08 10:31:23,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-08 10:31:23,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:23,142 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:31:23,142 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 10:31:23,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=393, Invalid=1246, Unknown=1, NotChecked=0, Total=1640 [2022-04-08 10:31:23,143 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:31:23,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 75 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 10:31:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 10:31:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 10:31:23,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:31:23,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,153 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,153 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:23,154 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 10:31:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 10:31:23,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:23,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:23,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 29 states. [2022-04-08 10:31:23,154 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 29 states. [2022-04-08 10:31:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:23,155 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 10:31:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 10:31:23,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:23,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:23,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:31:23,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:31:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-08 10:31:23,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-08 10:31:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:31:23,156 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-08 10:31:23,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:23,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-08 10:31:23,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 10:31:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:31:23,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:31:23,238 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:31:23,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 10:31:23,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 10:31:23,440 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:31:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:31:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 106590843, now seen corresponding path program 29 times [2022-04-08 10:31:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:23,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [20892208] [2022-04-08 10:31:23,443 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:31:23,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:31:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash 106590843, now seen corresponding path program 30 times [2022-04-08 10:31:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:31:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934870309] [2022-04-08 10:31:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:31:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:31:23,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:31:23,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247754835] [2022-04-08 10:31:23,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:31:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:31:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:31:23,464 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:31:23,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 10:31:24,167 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:31:24,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:31:24,171 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-08 10:31:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:24,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:31:25,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {4388#true} call ULTIMATE.init(); {4388#true} is VALID [2022-04-08 10:31:25,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#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; {4396#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:25,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4396#(= ~SIZE~0 20000001)} assume true; {4396#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:25,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4396#(= ~SIZE~0 20000001)} {4388#true} #55#return; {4396#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:25,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {4396#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {4396#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:25,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {4396#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4396#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:31:25,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {4396#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {4412#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:31:25,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {4412#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4416#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= main_~k~0 3) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:31:25,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {4416#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= main_~k~0 3) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4420#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-08 10:31:25,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {4420#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4424#(and (= (+ (- 9) main_~i~0) 0) (= main_~k~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:31:25,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {4424#(and (= (+ (- 9) main_~i~0) 0) (= main_~k~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4428#(and (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= 9 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 12)) 0))} is VALID [2022-04-08 10:31:25,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {4428#(and (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= 9 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 12)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4432#(and (= (+ (- 15) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 15))} is VALID [2022-04-08 10:31:25,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {4432#(and (= (+ (- 15) main_~i~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4436#(and (= (+ main_~j~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:31:25,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {4436#(and (= (+ main_~j~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4440#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} is VALID [2022-04-08 10:31:25,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {4440#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4444#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:31:25,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {4444#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4448#(and (= (+ main_~j~0 (- 6)) 21) (= 21 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 24) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:31:25,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {4448#(and (= (+ main_~j~0 (- 6)) 21) (= 21 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 24) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4452#(and (= 30 main_~j~0) (= 21 (+ (- 9) main_~k~0)) (= (+ main_~i~0 (- 6)) 24) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:31:25,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {4452#(and (= 30 main_~j~0) (= 21 (+ (- 9) main_~k~0)) (= (+ main_~i~0 (- 6)) 24) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4456#(and (= (+ main_~j~0 (- 3)) 30) (= (+ main_~k~0 (- 12)) 21) (= ~SIZE~0 20000001) (= (+ (- 9) main_~i~0) 24))} is VALID [2022-04-08 10:31:25,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {4456#(and (= (+ main_~j~0 (- 3)) 30) (= (+ main_~k~0 (- 12)) 21) (= ~SIZE~0 20000001) (= (+ (- 9) main_~i~0) 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4460#(and (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 30) (= main_~i~0 36))} is VALID [2022-04-08 10:31:25,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {4460#(and (= main_~k~0 36) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 30) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4464#(and (= main_~j~0 39) (= main_~k~0 39) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:31:25,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {4464#(and (= main_~j~0 39) (= main_~k~0 39) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4468#(and (< 39 (mod main_~n~0 4294967296)) (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:31:25,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {4468#(and (< 39 (mod main_~n~0 4294967296)) (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4472#(and (< 39 (mod main_~n~0 4294967296)) (= 39 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} is VALID [2022-04-08 10:31:25,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {4472#(and (< 39 (mod main_~n~0 4294967296)) (= 39 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {4476#(and (< 39 (mod main_~n~0 4294967296)) (= 39 (+ main_~k~0 (- 6))) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} is VALID [2022-04-08 10:31:25,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {4476#(and (< 39 (mod main_~n~0 4294967296)) (= 39 (+ main_~k~0 (- 6))) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} assume ~n~0 % 4294967296 > 0; {4480#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} is VALID [2022-04-08 10:31:25,044 INFO L272 TraceCheckUtils]: 24: Hoare triple {4480#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {4484#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:31:25,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {4484#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4488#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:31:25,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {4488#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4389#false} is VALID [2022-04-08 10:31:25,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {4389#false} assume !false; {4389#false} is VALID [2022-04-08 10:31:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:25,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:25,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {4389#false} assume !false; {4389#false} is VALID [2022-04-08 10:32:25,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {4488#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4389#false} is VALID [2022-04-08 10:32:25,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {4484#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4488#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:32:25,262 INFO L272 TraceCheckUtils]: 24: Hoare triple {4504#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {4484#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:32:25,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {4508#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {4504#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:32:25,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {4512#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {4508#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:32:25,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {4516#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4512#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:32:25,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {4520#(or (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4516#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:32:25,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(or (<= (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4520#(or (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:32:25,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {4528#(or (<= (+ (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4524#(or (<= (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:32:25,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {4532#(or (<= (+ (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4528#(or (<= (+ (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:32:25,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {4536#(or (<= (+ (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 18) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4532#(or (<= (+ (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:32:25,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {4540#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4536#(or (<= (+ (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 18) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:32:25,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {4544#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 18) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4540#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} is VALID [2022-04-08 10:32:25,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {4548#(or (<= (+ (div (+ (mod (+ main_~i~0 18) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296)) (div (+ (mod (+ main_~i~0 21) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296))) 1) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4544#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 18) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:32:25,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {4552#(or (<= (+ (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 24) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296))) 1) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4548#(or (<= (+ (div (+ (mod (+ main_~i~0 18) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296)) (div (+ (mod (+ main_~i~0 21) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296))) 1) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:32:25,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {4556#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (+ (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ main_~i~0 33) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ main_~i~0 24) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4552#(or (<= (+ (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) (div (+ (mod (+ main_~i~0 24) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296))) 1) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:32:25,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {4560#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (+ (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ main_~i~0 36) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4556#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (+ (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ main_~i~0 33) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ main_~i~0 24) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:32:25,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {4564#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4560#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (+ (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ main_~i~0 36) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:32:25,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {4568#(or (<= (+ (div (+ (mod (+ main_~i~0 36) 4294967296) (* (- 1) (mod (+ 42 main_~i~0) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4564#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:32:25,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {4572#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ main_~i~0 39) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4568#(or (<= (+ (div (+ (mod (+ main_~i~0 36) 4294967296) (* (- 1) (mod (+ 42 main_~i~0) 4294967296))) (- 4294967296)) (div (+ (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:32:25,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {4572#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ main_~i~0 39) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:32:25,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:25,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:25,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {4388#true} #55#return; {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:25,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:25,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {4388#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; {4576#(not (= (mod (mod 45 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:25,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {4388#true} call ULTIMATE.init(); {4388#true} is VALID [2022-04-08 10:32:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934870309] [2022-04-08 10:32:25,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:32:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247754835] [2022-04-08 10:32:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247754835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:25,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:32:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2022-04-08 10:32:25,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [20892208] [2022-04-08 10:32:25,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [20892208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:25,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:32:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433632553] [2022-04-08 10:32:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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) Word has length 28 [2022-04-08 10:32:25,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:25,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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-08 10:32:25,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:25,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:32:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:32:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1274, Unknown=2, NotChecked=0, Total=1722 [2022-04-08 10:32:25,587 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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-08 10:32:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,586 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 10:32:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:32:29,586 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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) Word has length 28 [2022-04-08 10:32:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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-08 10:32:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-08 10:32:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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-08 10:32:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-08 10:32:29,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-08 10:32:29,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:29,664 INFO L225 Difference]: With dead ends: 36 [2022-04-08 10:32:29,664 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 10:32:29,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 58.9s TimeCoverageRelationStatistics Valid=458, Invalid=1432, Unknown=2, NotChecked=0, Total=1892 [2022-04-08 10:32:29,665 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:32:29,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:32:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 10:32:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 10:32:29,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:29,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:29,682 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:29,682 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,682 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 10:32:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 10:32:29,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:29,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:29,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 10:32:29,683 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 10:32:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:29,683 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 10:32:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 10:32:29,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:29,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:29,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:29,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-08 10:32:29,685 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-08 10:32:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:29,685 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-08 10:32:29,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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-08 10:32:29,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-08 10:32:29,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 10:32:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:32:29,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:29,767 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:29,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 10:32:29,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:32:29,967 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 534406810, now seen corresponding path program 31 times [2022-04-08 10:32:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245748114] [2022-04-08 10:32:29,971 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:29,971 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 534406810, now seen corresponding path program 32 times [2022-04-08 10:32:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:29,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420069394] [2022-04-08 10:32:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:29,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:32:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686778733] [2022-04-08 10:32:29,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:32:29,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:29,992 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:29,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 10:32:30,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:32:30,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:30,116 WARN L261 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 109 conjunts are in the unsatisfiable core [2022-04-08 10:32:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:30,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:30,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {4793#true} call ULTIMATE.init(); {4793#true} is VALID [2022-04-08 10:32:30,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {4793#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; {4801#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:30,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {4801#(= ~SIZE~0 20000001)} assume true; {4801#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:30,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4801#(= ~SIZE~0 20000001)} {4793#true} #55#return; {4801#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:30,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {4801#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {4801#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:30,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {4801#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4801#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:30,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {4801#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {4817#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:32:30,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {4817#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4821#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:32:30,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {4821#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4825#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:32:30,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {4825#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4829#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-08 10:32:30,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {4829#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4833#(and (= main_~k~0 12) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 9) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-08 10:32:30,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {4833#(and (= main_~k~0 12) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 9) (= (+ main_~j~0 (- 6)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4837#(and (= main_~i~0 15) (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= main_~k~0 15))} is VALID [2022-04-08 10:32:30,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {4837#(and (= main_~i~0 15) (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= main_~k~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4841#(and (= (+ main_~j~0 (- 12)) 6) (= (+ main_~i~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:30,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {4841#(and (= (+ main_~j~0 (- 12)) 6) (= (+ main_~i~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4845#(and (= (+ main_~i~0 (- 6)) 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= 6 (+ (- 15) main_~j~0)))} is VALID [2022-04-08 10:32:30,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {4845#(and (= (+ main_~i~0 (- 6)) 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= 6 (+ (- 15) main_~j~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4849#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24))} is VALID [2022-04-08 10:32:30,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {4849#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4853#(and (= main_~j~0 27) (= (+ main_~i~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:30,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {4853#(and (= main_~j~0 27) (= (+ main_~i~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4857#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:32:30,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {4857#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4861#(and (= (+ main_~j~0 (- 3)) 30) (= 30 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:32:30,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {4861#(and (= (+ main_~j~0 (- 3)) 30) (= 30 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= main_~i~0 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4865#(and (= (+ main_~i~0 (- 3)) 33) (= ~SIZE~0 20000001) (= 30 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 6)) 30))} is VALID [2022-04-08 10:32:30,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {4865#(and (= (+ main_~i~0 (- 3)) 33) (= ~SIZE~0 20000001) (= 30 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 6)) 30))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4869#(and (= 30 (+ (- 9) main_~k~0)) (= (+ main_~i~0 (- 6)) 33) (= 30 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:30,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {4869#(and (= 30 (+ (- 9) main_~k~0)) (= (+ main_~i~0 (- 6)) 33) (= 30 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4873#(and (= 42 main_~k~0) (= 30 (+ main_~j~0 (- 12))) (= ~SIZE~0 20000001) (= 42 main_~i~0))} is VALID [2022-04-08 10:32:30,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {4873#(and (= 42 main_~k~0) (= 30 (+ main_~j~0 (- 12))) (= ~SIZE~0 20000001) (= 42 main_~i~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4877#(and (= 42 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= 30 (+ (- 15) main_~j~0)))} is VALID [2022-04-08 10:32:30,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {4877#(and (= 42 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= 30 (+ (- 15) main_~j~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4881#(and (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))) (= 30 (+ main_~j~0 (- 18))))} is VALID [2022-04-08 10:32:30,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {4881#(and (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))) (= 30 (+ main_~j~0 (- 18))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {4885#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))) (= 30 (+ main_~j~0 (- 18))))} is VALID [2022-04-08 10:32:30,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {4885#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))) (= 30 (+ main_~j~0 (- 18))))} assume ~n~0 % 4294967296 > 0; {4881#(and (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))) (= 30 (+ main_~j~0 (- 18))))} is VALID [2022-04-08 10:32:30,970 INFO L272 TraceCheckUtils]: 25: Hoare triple {4881#(and (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))) (= 30 (+ main_~j~0 (- 18))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {4892#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:32:30,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {4892#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4896#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:32:30,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {4896#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4794#false} is VALID [2022-04-08 10:32:30,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {4794#false} assume !false; {4794#false} is VALID [2022-04-08 10:32:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:30,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:32:50,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {4794#false} assume !false; {4794#false} is VALID [2022-04-08 10:32:50,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {4896#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4794#false} is VALID [2022-04-08 10:32:50,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {4892#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4896#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:32:50,330 INFO L272 TraceCheckUtils]: 25: Hoare triple {4912#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {4892#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:32:50,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {4916#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {4912#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:32:50,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {4920#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {4916#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:32:50,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {4924#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4920#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {4928#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4924#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {4932#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4928#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:32:50,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {4936#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4932#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:32:50,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {4940#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4936#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:32:50,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {4944#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4940#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:32:50,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {4948#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4944#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:32:50,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {4952#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4948#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {4956#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4952#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {4960#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4956#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:32:50,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {4964#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4960#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:32:50,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {4968#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4964#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {4972#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4968#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:32:50,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {4976#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4972#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {4980#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4976#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:32:50,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {4984#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {4980#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:32:50,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {4984#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:32:50,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:50,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:50,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {4793#true} #55#return; {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:50,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:50,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {4793#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; {4988#(not (= (mod (mod 48 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:32:50,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {4793#true} call ULTIMATE.init(); {4793#true} is VALID [2022-04-08 10:32:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:50,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:32:50,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420069394] [2022-04-08 10:32:50,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:32:50,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686778733] [2022-04-08 10:32:50,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686778733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:32:50,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:32:50,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 43 [2022-04-08 10:32:50,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:32:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245748114] [2022-04-08 10:32:50,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245748114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:32:50,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:32:50,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:32:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690735769] [2022-04-08 10:32:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:32:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-08 10:32:50,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:32:50,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:50,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:50,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:32:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:32:50,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:32:50,529 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:54,614 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 10:32:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:32:54,614 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-08 10:32:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:32:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-08 10:32:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-08 10:32:54,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-08 10:32:54,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:54,701 INFO L225 Difference]: With dead ends: 37 [2022-04-08 10:32:54,701 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 10:32:54,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=475, Invalid=1505, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 10:32:54,702 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:32:54,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:32:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 10:32:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 10:32:54,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:32:54,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,718 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,718 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:54,719 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 10:32:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 10:32:54,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:54,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:54,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 10:32:54,719 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 10:32:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:32:54,720 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 10:32:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 10:32:54,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:32:54,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:32:54,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:32:54,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:32:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 10:32:54,721 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-08 10:32:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:32:54,722 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 10:32:54,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:32:54,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 10:32:54,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:32:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 10:32:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:32:54,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:32:54,821 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:32:54,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 10:32:55,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 10:32:55,024 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:32:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:32:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 911799899, now seen corresponding path program 33 times [2022-04-08 10:32:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:32:55,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794431125] [2022-04-08 10:32:55,027 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:32:55,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:32:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 911799899, now seen corresponding path program 34 times [2022-04-08 10:32:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:32:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336197728] [2022-04-08 10:32:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:32:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:32:55,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:32:55,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878741812] [2022-04-08 10:32:55,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:32:55,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:32:55,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:32:55,045 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:32:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 10:32:55,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:32:55,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:32:55,204 WARN L261 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 115 conjunts are in the unsatisfiable core [2022-04-08 10:32:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:32:55,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:32:56,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {5211#true} call ULTIMATE.init(); {5211#true} is VALID [2022-04-08 10:32:56,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {5211#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; {5219#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:56,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#(= ~SIZE~0 20000001)} assume true; {5219#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:56,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#(= ~SIZE~0 20000001)} {5211#true} #55#return; {5219#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:56,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {5219#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:56,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5219#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:32:56,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {5219#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {5235#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:32:56,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {5235#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5239#(and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {5239#(and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5243#(and (= (+ main_~i~0 (- 3)) 3) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} is VALID [2022-04-08 10:32:56,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {5243#(and (= (+ main_~i~0 (- 3)) 3) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5247#(and (= 6 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 6)) 3) (= (+ main_~j~0 (- 6)) 3) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {5247#(and (= 6 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 6)) 3) (= (+ main_~j~0 (- 6)) 3) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5251#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {5251#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5255#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:32:56,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5259#(and (= (+ main_~j~0 (- 6)) 12) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:32:56,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {5259#(and (= (+ main_~j~0 (- 6)) 12) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5263#(and (= main_~i~0 21) (= (+ (- 9) main_~j~0) 12) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:32:56,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {5263#(and (= main_~i~0 21) (= (+ (- 9) main_~j~0) 12) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5267#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24))} is VALID [2022-04-08 10:32:56,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {5267#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~j~0 24) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5271#(and (= main_~j~0 27) (= (+ main_~k~0 (- 3)) 24) (= (+ main_~i~0 (- 3)) 24) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {5271#(and (= main_~j~0 27) (= (+ main_~k~0 (- 3)) 24) (= (+ main_~i~0 (- 3)) 24) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5275#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:32:56,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {5275#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5279#(and (= (+ main_~j~0 (- 3)) 30) (= 30 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {5279#(and (= (+ main_~j~0 (- 3)) 30) (= 30 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5283#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:32:56,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5287#(and (= (+ main_~j~0 (- 3)) 36) (= 30 (+ (- 9) main_~i~0)) (= main_~k~0 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {5287#(and (= (+ main_~j~0 (- 3)) 36) (= 30 (+ (- 9) main_~i~0)) (= main_~k~0 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5291#(and (= 30 (+ main_~i~0 (- 12))) (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 36))} is VALID [2022-04-08 10:32:56,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {5291#(and (= 30 (+ main_~i~0 (- 12))) (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5295#(and (= (+ (- 9) main_~j~0) 36) (= 39 (+ main_~k~0 (- 6))) (= main_~i~0 45) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {5295#(and (= (+ (- 9) main_~j~0) 36) (= 39 (+ main_~k~0 (- 6))) (= main_~i~0 45) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5299#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= main_~k~0 48))} is VALID [2022-04-08 10:32:56,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {5299#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5303#(and (= (+ main_~k~0 (- 3)) 48) (< 48 (mod main_~n~0 4294967296)) (= 51 main_~i~0) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 48))} is VALID [2022-04-08 10:32:56,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {5303#(and (= (+ main_~k~0 (- 3)) 48) (< 48 (mod main_~n~0 4294967296)) (= 51 main_~i~0) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 48))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {5307#(and (= 51 main_~k~0) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {5307#(and (= 51 main_~k~0) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} assume ~n~0 % 4294967296 > 0; {5307#(and (= 51 main_~k~0) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:32:56,091 INFO L272 TraceCheckUtils]: 26: Hoare triple {5307#(and (= 51 main_~k~0) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {5314#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:32:56,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {5314#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5318#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:32:56,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {5318#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5212#false} is VALID [2022-04-08 10:32:56,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {5212#false} assume !false; {5212#false} is VALID [2022-04-08 10:32:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:32:56,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:33:29,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {5212#false} assume !false; {5212#false} is VALID [2022-04-08 10:33:29,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {5318#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5212#false} is VALID [2022-04-08 10:33:29,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {5314#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5318#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:33:29,334 INFO L272 TraceCheckUtils]: 26: Hoare triple {5334#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {5314#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:33:29,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {5334#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {5334#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:29,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {5341#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {5334#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:29,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {5345#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5341#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:33:29,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {5349#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5345#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-08 10:33:29,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {5353#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5349#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:33:29,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {5357#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5353#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:33:29,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {5361#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5357#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:33:29,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {5365#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5361#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:33:29,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {5369#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (mod (+ main_~i~0 18) 4294967296) (* (- 1) (mod (+ main_~i~0 21) 4294967296))) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5365#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:33:29,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {5373#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ main_~i~0 24) 4294967296))) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5369#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (mod (+ main_~i~0 18) 4294967296) (* (- 1) (mod (+ main_~i~0 21) 4294967296))) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {5377#(or (<= (div (+ (mod (+ main_~i~0 24) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296)) 0) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5373#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ main_~i~0 24) 4294967296))) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {5381#(or (<= (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5377#(or (<= (div (+ (mod (+ main_~i~0 24) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296)) 0) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:33:29,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {5385#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5381#(or (<= (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:33:29,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {5389#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5385#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {5393#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5389#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {5397#(or (<= (div (+ (mod (+ main_~i~0 39) 4294967296) (* (- 1) (mod (+ 42 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5393#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {5401#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5397#(or (<= (div (+ (mod (+ main_~i~0 39) 4294967296) (* (- 1) (mod (+ 42 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:33:29,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {5405#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5401#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:33:29,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {5409#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= (div (+ (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (mod (+ main_~i~0 48) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5405#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {5409#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= (div (+ (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (mod (+ main_~i~0 48) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:33:29,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:29,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:29,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {5211#true} #55#return; {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:29,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:29,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {5211#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; {5413#(not (= (mod (mod 51 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:29,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {5211#true} call ULTIMATE.init(); {5211#true} is VALID [2022-04-08 10:33:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:33:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:33:29,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336197728] [2022-04-08 10:33:29,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:33:29,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878741812] [2022-04-08 10:33:29,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878741812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:33:29,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:33:29,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-04-08 10:33:29,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:33:29,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794431125] [2022-04-08 10:33:29,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794431125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:33:29,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:33:29,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:33:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146050465] [2022-04-08 10:33:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:33:29,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 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) Word has length 30 [2022-04-08 10:33:29,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:33:29,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:33:29,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:33:29,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:33:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:33:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:33:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1406, Unknown=1, NotChecked=0, Total=1892 [2022-04-08 10:33:29,607 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:33:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:33:34,502 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 10:33:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:33:34,503 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 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) Word has length 30 [2022-04-08 10:33:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:33:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:33:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-04-08 10:33:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:33:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2022-04-08 10:33:34,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 38 transitions. [2022-04-08 10:33:34,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:33:34,598 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:33:34,598 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:33:34,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=497, Invalid=1572, Unknown=1, NotChecked=0, Total=2070 [2022-04-08 10:33:34,599 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:33:34,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 10:33:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:33:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 10:33:34,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:33:34,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-08 10:33:34,609 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-08 10:33:34,609 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-08 10:33:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:33:34,610 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 10:33:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 10:33:34,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:33:34,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:33:34,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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 32 states. [2022-04-08 10:33:34,611 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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 32 states. [2022-04-08 10:33:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:33:34,611 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 10:33:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 10:33:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:33:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:33:34,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:33:34,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:33:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-08 10:33:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-08 10:33:34,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-08 10:33:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:33:34,613 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-08 10:33:34,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:33:34,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-08 10:33:34,726 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-08 10:33:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 10:33:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:33:34,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:33:34,727 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:33:34,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 10:33:34,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:33:34,927 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:33:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:33:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -273916230, now seen corresponding path program 35 times [2022-04-08 10:33:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:33:34,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943619006] [2022-04-08 10:33:34,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:33:34,930 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:33:34,930 INFO L85 PathProgramCache]: Analyzing trace with hash -273916230, now seen corresponding path program 36 times [2022-04-08 10:33:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:33:34,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215938711] [2022-04-08 10:33:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:33:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:33:34,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:33:34,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980214391] [2022-04-08 10:33:34,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:33:34,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:33:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:33:34,952 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:33:34,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 10:33:35,904 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:33:35,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:33:35,909 WARN L261 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 119 conjunts are in the unsatisfiable core [2022-04-08 10:33:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:33:35,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:33:36,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {5642#true} call ULTIMATE.init(); {5642#true} is VALID [2022-04-08 10:33:36,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {5642#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; {5650#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:33:36,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {5650#(= ~SIZE~0 20000001)} assume true; {5650#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:33:36,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5650#(= ~SIZE~0 20000001)} {5642#true} #55#return; {5650#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:33:36,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {5650#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {5650#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:33:36,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {5650#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5650#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:33:36,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {5650#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {5666#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:33:36,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {5666#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5670#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:33:36,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {5670#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5674#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:33:36,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {5674#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5678#(and (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 10:33:36,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {5678#(and (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5682#(and (= (+ main_~j~0 (- 3)) 9) (= 9 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {5682#(and (= (+ main_~j~0 (- 3)) 9) (= 9 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5686#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= main_~k~0 15))} is VALID [2022-04-08 10:33:36,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {5686#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= main_~k~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5690#(and (= 15 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 15) (= main_~j~0 18) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {5690#(and (= 15 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 15) (= main_~j~0 18) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5694#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 18))} is VALID [2022-04-08 10:33:36,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {5694#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5698#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:33:36,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {5698#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5702#(and (= main_~j~0 27) (= (+ main_~i~0 (- 6)) 21) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {5702#(and (= main_~j~0 27) (= (+ main_~i~0 (- 6)) 21) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5706#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:33:36,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {5706#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5710#(and (= (+ main_~j~0 (- 3)) 30) (= 30 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {5710#(and (= (+ main_~j~0 (- 3)) 30) (= 30 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5714#(and (= main_~j~0 36) (= ~SIZE~0 20000001) (= 30 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:33:36,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {5714#(and (= main_~j~0 36) (= ~SIZE~0 20000001) (= 30 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 6)) 30))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5718#(and (= (+ main_~j~0 (- 3)) 36) (= 30 (+ (- 9) main_~i~0)) (= main_~k~0 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {5718#(and (= (+ main_~j~0 (- 3)) 36) (= 30 (+ (- 9) main_~i~0)) (= main_~k~0 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5722#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= 42 main_~j~0))} is VALID [2022-04-08 10:33:36,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {5722#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= 42 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5726#(and (= 39 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= main_~j~0 45))} is VALID [2022-04-08 10:33:36,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {5726#(and (= 39 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= main_~j~0 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5730#(and (= (+ main_~j~0 (- 3)) 45) (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= main_~k~0 48))} is VALID [2022-04-08 10:33:36,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {5730#(and (= (+ main_~j~0 (- 3)) 45) (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5734#(and (= (+ main_~k~0 (- 3)) 48) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {5734#(and (= (+ main_~k~0 (- 3)) 48) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5738#(and (= 48 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 51) (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {5738#(and (= 48 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 51) (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {5738#(and (= 48 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 51) (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {5738#(and (= 48 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 51) (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001))} assume ~n~0 % 4294967296 > 0; {5738#(and (= 48 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 51) (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:33:36,604 INFO L272 TraceCheckUtils]: 27: Hoare triple {5738#(and (= 48 (+ main_~k~0 (- 6))) (= (+ main_~i~0 (- 3)) 51) (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {5748#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:33:36,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {5748#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5752#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:33:36,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {5752#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5643#false} is VALID [2022-04-08 10:33:36,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {5643#false} assume !false; {5643#false} is VALID [2022-04-08 10:33:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:33:36,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:33:55,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {5643#false} assume !false; {5643#false} is VALID [2022-04-08 10:33:55,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {5752#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5643#false} is VALID [2022-04-08 10:33:55,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {5748#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5752#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:33:55,520 INFO L272 TraceCheckUtils]: 27: Hoare triple {5768#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {5748#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:33:55,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {5768#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {5768#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:55,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {5768#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {5768#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:55,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {5778#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5768#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:55,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {5782#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5778#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} is VALID [2022-04-08 10:33:55,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {5786#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5782#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} is VALID [2022-04-08 10:33:55,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {5790#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5786#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} is VALID [2022-04-08 10:33:55,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5790#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} is VALID [2022-04-08 10:33:55,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {5798#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5794#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} is VALID [2022-04-08 10:33:55,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {5802#(and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5798#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} is VALID [2022-04-08 10:33:55,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {5806#(and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5802#(and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:55,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {5810#(and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5806#(and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296)))} is VALID [2022-04-08 10:33:55,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {5814#(and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5810#(and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296)))} is VALID [2022-04-08 10:33:55,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {5818#(and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5814#(and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296))))} is VALID [2022-04-08 10:33:55,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {5822#(and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5818#(and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296)))} is VALID [2022-04-08 10:33:55,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {5826#(and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5822#(and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296)))} is VALID [2022-04-08 10:33:55,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {5830#(and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5826#(and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:55,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {5834#(and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5830#(and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296)))} is VALID [2022-04-08 10:33:55,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {5838#(and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5834#(and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)))} is VALID [2022-04-08 10:33:55,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {5842#(and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5838#(and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:33:55,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {5846#(and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {5842#(and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)))} is VALID [2022-04-08 10:33:55,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {5846#(and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296)))} is VALID [2022-04-08 10:33:55,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:55,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:55,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {5642#true} #55#return; {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:55,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:55,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {5642#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; {5850#(not (= (mod (mod 54 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:33:55,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {5642#true} call ULTIMATE.init(); {5642#true} is VALID [2022-04-08 10:33:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:33:55,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:33:55,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215938711] [2022-04-08 10:33:55,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:33:55,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980214391] [2022-04-08 10:33:55,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980214391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:33:55,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:33:55,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-04-08 10:33:55,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:33:55,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943619006] [2022-04-08 10:33:55,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943619006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:33:55,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:33:55,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:33:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424148324] [2022-04-08 10:33:55,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:33:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:33:55,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:33:55,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:33:55,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:33:55,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:33:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:33:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:33:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=1408, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:33:55,750 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:01,516 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 10:34:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:34:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:34:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:34:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2022-04-08 10:34:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2022-04-08 10:34:01,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 39 transitions. [2022-04-08 10:34:01,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:01,650 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:34:01,651 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 10:34:01,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=496, Invalid=1574, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:34:01,652 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:34:01,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:34:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 10:34:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 10:34:01,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:34:01,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,663 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,663 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:01,664 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 10:34:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 10:34:01,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:34:01,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:34:01,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 33 states. [2022-04-08 10:34:01,665 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 33 states. [2022-04-08 10:34:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:01,666 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 10:34:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 10:34:01,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:34:01,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:34:01,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:34:01,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:34:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-08 10:34:01,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-08 10:34:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:34:01,667 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-08 10:34:01,667 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:01,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-08 10:34:01,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 10:34:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:34:01,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:34:01,773 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:34:01,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 10:34:01,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:34:01,974 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:34:01,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:34:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1623589435, now seen corresponding path program 37 times [2022-04-08 10:34:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:34:01,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662169079] [2022-04-08 10:34:01,979 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:34:01,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:34:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1623589435, now seen corresponding path program 38 times [2022-04-08 10:34:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:34:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433407461] [2022-04-08 10:34:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:34:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:34:01,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:34:01,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381914366] [2022-04-08 10:34:01,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:34:01,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:34:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:34:01,996 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:34:02,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 10:34:02,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:34:02,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:34:02,132 WARN L261 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-08 10:34:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:34:02,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:34:03,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {6085#true} call ULTIMATE.init(); {6085#true} is VALID [2022-04-08 10:34:03,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {6085#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; {6093#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:03,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {6093#(= ~SIZE~0 20000001)} assume true; {6093#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:03,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6093#(= ~SIZE~0 20000001)} {6085#true} #55#return; {6093#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:03,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {6093#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {6093#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:03,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {6093#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {6093#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:03,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {6093#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {6109#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:34:03,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {6109#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6113#(and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:03,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {6113#(and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6117#(and (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6))} is VALID [2022-04-08 10:34:03,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {6117#(and (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6121#(and (= 6 (+ main_~k~0 (- 3))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 10:34:03,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {6121#(and (= 6 (+ main_~k~0 (- 3))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6125#(and (= main_~j~0 12) (= main_~i~0 12) (= 6 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:03,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {6125#(and (= main_~j~0 12) (= main_~i~0 12) (= 6 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6129#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= 6 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:03,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {6129#(and (= (+ main_~j~0 (- 3)) 12) (= main_~i~0 15) (= 6 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6133#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:34:03,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {6133#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6137#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~j~0 (- 3)) 18))} is VALID [2022-04-08 10:34:03,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {6137#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~j~0 (- 3)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6141#(and (= main_~i~0 24) (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 18))} is VALID [2022-04-08 10:34:03,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {6141#(and (= main_~i~0 24) (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6145#(and (= main_~j~0 27) (= main_~i~0 27) (= 18 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:03,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {6145#(and (= main_~j~0 27) (= main_~i~0 27) (= 18 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6149#(and (= 30 main_~j~0) (= 30 main_~i~0) (= (+ main_~k~0 (- 12)) 18) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:03,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {6149#(and (= 30 main_~j~0) (= 30 main_~i~0) (= (+ main_~k~0 (- 12)) 18) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6153#(and (= (+ (- 15) main_~k~0) 18) (= (+ main_~j~0 (- 3)) 30) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:34:03,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {6153#(and (= (+ (- 15) main_~k~0) 18) (= (+ main_~j~0 (- 3)) 30) (= ~SIZE~0 20000001) (= main_~i~0 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6157#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} is VALID [2022-04-08 10:34:03,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {6157#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6161#(and (= (+ main_~j~0 (- 3)) 36) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 36))} is VALID [2022-04-08 10:34:03,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {6161#(and (= (+ main_~j~0 (- 3)) 36) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6165#(and (= ~SIZE~0 20000001) (= 42 main_~i~0) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 6)) 36))} is VALID [2022-04-08 10:34:03,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {6165#(and (= ~SIZE~0 20000001) (= 42 main_~i~0) (= 36 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 6)) 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6169#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} is VALID [2022-04-08 10:34:03,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {6169#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6173#(and (= (+ main_~i~0 (- 3)) 45) (= (+ main_~j~0 (- 3)) 45) (= ~SIZE~0 20000001) (= main_~k~0 48))} is VALID [2022-04-08 10:34:03,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {6173#(and (= (+ main_~i~0 (- 3)) 45) (= (+ main_~j~0 (- 3)) 45) (= ~SIZE~0 20000001) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6177#(and (= 51 main_~k~0) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:03,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {6177#(and (= 51 main_~k~0) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6181#(and (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001) (= 51 (+ main_~k~0 (- 3))) (= main_~i~0 54))} is VALID [2022-04-08 10:34:03,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {6181#(and (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001) (= 51 (+ main_~k~0 (- 3))) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6185#(and (= 57 main_~i~0) (= 51 (+ main_~k~0 (- 6))) (< 54 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 51))} is VALID [2022-04-08 10:34:03,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {6185#(and (= 57 main_~i~0) (= 51 (+ main_~k~0 (- 6))) (< 54 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 51))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {6189#(and (= 57 main_~i~0) (= 51 (+ main_~k~0 (- 6))) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< 54 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 51))} is VALID [2022-04-08 10:34:03,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {6189#(and (= 57 main_~i~0) (= 51 (+ main_~k~0 (- 6))) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< 54 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 51))} assume ~n~0 % 4294967296 > 0; {6193#(and (= 57 main_~i~0) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= 57 main_~j~0))} is VALID [2022-04-08 10:34:03,237 INFO L272 TraceCheckUtils]: 28: Hoare triple {6193#(and (= 57 main_~i~0) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= 57 main_~j~0))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {6197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:34:03,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {6197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:34:03,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {6201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6086#false} is VALID [2022-04-08 10:34:03,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {6086#false} assume !false; {6086#false} is VALID [2022-04-08 10:34:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:34:03,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:34:47,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {6086#false} assume !false; {6086#false} is VALID [2022-04-08 10:34:47,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {6201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6086#false} is VALID [2022-04-08 10:34:47,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {6197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:34:47,557 INFO L272 TraceCheckUtils]: 28: Hoare triple {6217#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {6197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:34:47,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {6221#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {6217#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:34:47,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {6225#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {6221#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:34:47,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {6229#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6225#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:34:47,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {6233#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6229#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-08 10:34:47,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {6237#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6233#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:34:47,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {6241#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6237#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:34:47,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {6245#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6241#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:34:47,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {6249#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6245#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:34:47,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {6253#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (mod (+ main_~i~0 18) 4294967296) (* (- 1) (mod (+ main_~i~0 21) 4294967296))) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6249#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:34:47,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {6257#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ main_~i~0 24) 4294967296))) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6253#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (mod (+ main_~i~0 18) 4294967296) (* (- 1) (mod (+ main_~i~0 21) 4294967296))) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {6261#(or (<= (div (+ (mod (+ main_~i~0 24) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296)) 0) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6257#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ main_~i~0 24) 4294967296))) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {6265#(or (<= (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6261#(or (<= (div (+ (mod (+ main_~i~0 24) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296)) 0) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:34:47,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {6269#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6265#(or (<= (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:34:47,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {6273#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6269#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {6277#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6273#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {6281#(or (<= (div (+ (mod (+ main_~i~0 39) 4294967296) (* (- 1) (mod (+ 42 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6277#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {6285#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6281#(or (<= (div (+ (mod (+ main_~i~0 39) 4294967296) (* (- 1) (mod (+ 42 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:34:47,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {6289#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6285#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:34:47,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {6293#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= (div (+ (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (mod (+ main_~i~0 48) 4294967296)) (- 4294967296)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6289#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (div (+ (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {6297#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 54) 4294967296)) (mod (+ 51 main_~i~0) 4294967296)) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6293#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= (div (+ (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (mod (+ main_~i~0 48) 4294967296)) (- 4294967296)) 0))} is VALID [2022-04-08 10:34:47,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {6301#(or (<= (div (+ (mod (+ main_~i~0 54) 4294967296) (* (- 1) (mod (+ 57 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6297#(or (<= (div (+ (* (- 1) (mod (+ main_~i~0 54) 4294967296)) (mod (+ 51 main_~i~0) 4294967296)) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} is VALID [2022-04-08 10:34:47,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {6301#(or (<= (div (+ (mod (+ main_~i~0 54) 4294967296) (* (- 1) (mod (+ 57 main_~i~0) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} is VALID [2022-04-08 10:34:47,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:34:47,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:34:47,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {6085#true} #55#return; {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:34:47,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:34:47,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {6085#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; {6305#(not (= (mod (mod 57 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:34:47,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {6085#true} call ULTIMATE.init(); {6085#true} is VALID [2022-04-08 10:34:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:34:47,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:34:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433407461] [2022-04-08 10:34:47,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:34:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381914366] [2022-04-08 10:34:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381914366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:34:47,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:34:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2022-04-08 10:34:47,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:34:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662169079] [2022-04-08 10:34:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662169079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:34:47,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:34:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:34:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769990119] [2022-04-08 10:34:47,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:34:47,746 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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) Word has length 32 [2022-04-08 10:34:47,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:34:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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-08 10:34:47,859 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-08 10:34:47,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:34:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:34:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:34:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=1820, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:34:47,861 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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-08 10:34:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:55,402 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 10:34:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:34:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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) Word has length 32 [2022-04-08 10:34:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:34:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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-08 10:34:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-08 10:34:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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-08 10:34:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-08 10:34:55,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-08 10:34:55,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:55,534 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:34:55,534 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:34:55,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=642, Invalid=2010, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:34:55,535 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:34:55,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-08 10:34:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:34:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 10:34:55,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:34:55,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:55,546 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:55,546 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:55,547 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 10:34:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 10:34:55,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:34:55,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:34:55,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 34 states. [2022-04-08 10:34:55,547 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 34 states. [2022-04-08 10:34:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:34:55,548 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 10:34:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 10:34:55,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:34:55,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:34:55,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:34:55,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:34:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:34:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-08 10:34:55,550 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-08 10:34:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:34:55,550 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-08 10:34:55,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 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-08 10:34:55,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-08 10:34:55,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:34:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 10:34:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:34:55,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:34:55,675 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:34:55,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-08 10:34:55,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:34:55,876 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:34:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:34:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash 316722906, now seen corresponding path program 39 times [2022-04-08 10:34:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:34:55,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391539540] [2022-04-08 10:34:55,879 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:34:55,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:34:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash 316722906, now seen corresponding path program 40 times [2022-04-08 10:34:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:34:55,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480890471] [2022-04-08 10:34:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:34:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:34:55,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:34:55,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817185596] [2022-04-08 10:34:55,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:34:55,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:34:55,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:34:55,900 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:34:55,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 10:34:55,977 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:34:55,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:34:55,979 WARN L261 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-08 10:34:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:34:55,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:34:56,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {6546#true} call ULTIMATE.init(); {6546#true} is VALID [2022-04-08 10:34:56,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {6546#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; {6554#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:56,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {6554#(= ~SIZE~0 20000001)} assume true; {6554#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:56,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6554#(= ~SIZE~0 20000001)} {6546#true} #55#return; {6554#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:56,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {6554#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {6554#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:56,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {6554#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {6554#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:34:57,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {6554#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {6570#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:34:57,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {6570#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6574#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:34:57,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {6574#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6578#(and (= main_~i~0 main_~k~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:57,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {6578#(and (= main_~i~0 main_~k~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6582#(and (= (+ (- 9) main_~j~0) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:34:57,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {6582#(and (= (+ (- 9) main_~j~0) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6586#(and (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 12)) 0))} is VALID [2022-04-08 10:34:57,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {6586#(and (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 12)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6590#(and (= ~SIZE~0 20000001) (= (+ (- 15) main_~k~0) 0) (= main_~k~0 main_~j~0) (= (+ (- 9) main_~i~0) (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:34:57,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {6590#(and (= ~SIZE~0 20000001) (= (+ (- 15) main_~k~0) 0) (= main_~k~0 main_~j~0) (= (+ (- 9) main_~i~0) (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6594#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:34:57,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {6594#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6598#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} is VALID [2022-04-08 10:34:57,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {6598#(and (= main_~k~0 21) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6602#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:34:57,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {6602#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6606#(and (= main_~j~0 27) (= main_~i~0 27) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:57,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {6606#(and (= main_~j~0 27) (= main_~i~0 27) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6610#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~j~0 (- 3)) 27) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} is VALID [2022-04-08 10:34:57,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {6610#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~j~0 (- 3)) 27) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6614#(and (= main_~k~0 33) (= (+ main_~j~0 (- 6)) 27) (= (+ main_~i~0 (- 6)) 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:57,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {6614#(and (= main_~k~0 33) (= (+ main_~j~0 (- 6)) 27) (= (+ main_~i~0 (- 6)) 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6618#(and (= (+ main_~k~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} is VALID [2022-04-08 10:34:57,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {6618#(and (= (+ main_~k~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6622#(and (= main_~j~0 39) (= main_~k~0 39) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:57,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {6622#(and (= main_~j~0 39) (= main_~k~0 39) (= (+ main_~i~0 (- 3)) 36) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6626#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= 42 main_~j~0))} is VALID [2022-04-08 10:34:57,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {6626#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= 42 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6630#(and (= 39 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 42) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:34:57,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {6630#(and (= 39 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 42) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6634#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= 39 (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:34:57,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {6634#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= 39 (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6638#(and (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 48) (= (+ main_~k~0 (- 12)) 39) (= (+ main_~i~0 (- 3)) 48))} is VALID [2022-04-08 10:34:57,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {6638#(and (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 48) (= (+ main_~k~0 (- 12)) 39) (= (+ main_~i~0 (- 3)) 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6642#(and (= (+ main_~j~0 (- 6)) 48) (= ~SIZE~0 20000001) (= main_~i~0 54) (= (+ (- 15) main_~k~0) 39))} is VALID [2022-04-08 10:34:57,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#(and (= (+ main_~j~0 (- 6)) 48) (= ~SIZE~0 20000001) (= main_~i~0 54) (= (+ (- 15) main_~k~0) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6646#(and (= 57 main_~i~0) (= 48 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= 39 (+ main_~k~0 (- 18))))} is VALID [2022-04-08 10:34:57,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {6646#(and (= 57 main_~i~0) (= 48 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= 39 (+ main_~k~0 (- 18))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6650#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= (+ main_~j~0 (- 12)) 48))} is VALID [2022-04-08 10:34:57,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {6650#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= (+ main_~j~0 (- 12)) 48))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {6654#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= (+ main_~j~0 (- 12)) 48))} is VALID [2022-04-08 10:34:57,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {6654#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= (+ main_~j~0 (- 12)) 48))} assume ~n~0 % 4294967296 > 0; {6650#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= (+ main_~j~0 (- 12)) 48))} is VALID [2022-04-08 10:34:57,011 INFO L272 TraceCheckUtils]: 29: Hoare triple {6650#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= (+ main_~j~0 (- 12)) 48))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {6661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:34:57,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {6661#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:34:57,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {6665#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6547#false} is VALID [2022-04-08 10:34:57,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {6547#false} assume !false; {6547#false} is VALID [2022-04-08 10:34:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:34:57,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:35:35,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {6547#false} assume !false; {6547#false} is VALID [2022-04-08 10:35:35,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {6665#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6547#false} is VALID [2022-04-08 10:35:35,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {6661#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:35:35,066 INFO L272 TraceCheckUtils]: 29: Hoare triple {6681#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {6661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:35:35,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {6685#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {6681#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:35:35,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {6689#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {6685#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:35:35,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {6693#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6689#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {6697#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6693#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {6701#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6697#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:35:35,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {6705#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6701#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:35:35,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {6709#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6705#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:35:35,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {6713#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6709#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:35:35,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {6717#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6713#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:35:35,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {6721#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6717#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {6725#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6721#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {6729#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6725#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:35:35,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {6733#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6729#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:35:35,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {6737#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6733#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {6741#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6737#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:35:35,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {6745#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6741#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {6749#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6745#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:35:35,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {6753#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6749#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:35:35,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {6757#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6753#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {6761#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6757#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {6765#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6761#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} is VALID [2022-04-08 10:35:35,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {6769#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {6765#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {6769#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:35:35,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:35:35,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:35:35,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {6546#true} #55#return; {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:35:35,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:35:35,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {6546#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; {6773#(not (= (mod (mod 60 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:35:35,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {6546#true} call ULTIMATE.init(); {6546#true} is VALID [2022-04-08 10:35:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:35:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:35:35,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480890471] [2022-04-08 10:35:35,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:35:35,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817185596] [2022-04-08 10:35:35,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817185596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:35:35,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:35:35,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2022-04-08 10:35:35,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:35:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391539540] [2022-04-08 10:35:35,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391539540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:35:35,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:35:35,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:35:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990135140] [2022-04-08 10:35:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:35:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-08 10:35:35,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:35:35,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:35,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:35:35,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:35:35,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:35:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:35:35,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1898, Unknown=1, NotChecked=0, Total=2550 [2022-04-08 10:35:35,388 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:35:44,778 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 10:35:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:35:44,778 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 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 33 [2022-04-08 10:35:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:35:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-08 10:35:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-08 10:35:44,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-08 10:35:44,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:35:44,902 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:35:44,902 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 10:35:44,903 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=663, Invalid=2092, Unknown=1, NotChecked=0, Total=2756 [2022-04-08 10:35:44,904 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:35:44,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-08 10:35:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 10:35:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 10:35:44,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:35:44,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,916 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,916 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:35:44,917 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 10:35:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 10:35:44,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:35:44,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:35:44,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-08 10:35:44,917 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-08 10:35:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:35:44,918 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 10:35:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 10:35:44,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:35:44,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:35:44,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:35:44,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:35:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-08 10:35:44,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-08 10:35:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:35:44,920 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-08 10:35:44,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:35:44,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-08 10:35:45,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:35:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 10:35:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:35:45,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:35:45,094 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:35:45,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 10:35:45,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:35:45,295 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:35:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:35:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1541433829, now seen corresponding path program 41 times [2022-04-08 10:35:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:35:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966853187] [2022-04-08 10:35:45,307 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:35:45,307 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:35:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1541433829, now seen corresponding path program 42 times [2022-04-08 10:35:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:35:45,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171189110] [2022-04-08 10:35:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:35:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:35:45,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:35:45,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579724656] [2022-04-08 10:35:45,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:35:45,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:35:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:35:45,328 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:35:45,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 10:35:46,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 10:35:46,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:35:46,191 WARN L261 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 137 conjunts are in the unsatisfiable core [2022-04-08 10:35:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:35:46,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:35:46,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {7020#true} call ULTIMATE.init(); {7020#true} is VALID [2022-04-08 10:35:46,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {7020#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; {7028#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:35:46,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {7028#(= ~SIZE~0 20000001)} assume true; {7028#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:35:46,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7028#(= ~SIZE~0 20000001)} {7020#true} #55#return; {7028#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:35:46,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {7028#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {7028#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:35:46,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {7028#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7028#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:35:46,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {7028#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {7044#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:35:46,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {7044#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7048#(and (= main_~j~0 3) (= main_~k~0 3) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {7048#(and (= main_~j~0 3) (= main_~k~0 3) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7052#(and (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-08 10:35:46,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {7052#(and (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7056#(and (= (+ (- 9) main_~i~0) 0) (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {7056#(and (= (+ (- 9) main_~i~0) 0) (= main_~k~0 9) (= main_~j~0 9) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7060#(and (= (+ main_~j~0 (- 3)) 9) (= 9 (+ main_~k~0 (- 3))) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {7060#(and (= (+ main_~j~0 (- 3)) 9) (= 9 (+ main_~k~0 (- 3))) (= main_~i~0 12) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7064#(and (= main_~i~0 15) (= 9 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 9))} is VALID [2022-04-08 10:35:46,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {7064#(and (= main_~i~0 15) (= 9 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 9))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7068#(and (= 9 (+ (- 9) main_~j~0)) (= main_~k~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:35:46,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {7068#(and (= 9 (+ (- 9) main_~j~0)) (= main_~k~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7072#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:35:46,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {7072#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7076#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:35:46,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {7076#(and (= (+ main_~j~0 (- 3)) 21) (= main_~i~0 24) (= ~SIZE~0 20000001) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7080#(and (= main_~j~0 27) (= main_~i~0 27) (= 21 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {7080#(and (= main_~j~0 27) (= main_~i~0 27) (= 21 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7084#(and (= 21 (+ (- 9) main_~k~0)) (= (+ main_~i~0 (- 3)) 27) (= (+ main_~j~0 (- 3)) 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {7084#(and (= 21 (+ (- 9) main_~k~0)) (= (+ main_~i~0 (- 3)) 27) (= (+ main_~j~0 (- 3)) 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7088#(and (= (+ main_~k~0 (- 12)) 21) (= main_~j~0 33) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:35:46,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {7088#(and (= (+ main_~k~0 (- 12)) 21) (= main_~j~0 33) (= ~SIZE~0 20000001) (= main_~i~0 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7092#(and (= (+ main_~i~0 (- 3)) 33) (= (+ main_~j~0 (- 3)) 33) (= (+ (- 15) main_~k~0) 21) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {7092#(and (= (+ main_~i~0 (- 3)) 33) (= (+ main_~j~0 (- 3)) 33) (= (+ (- 15) main_~k~0) 21) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7096#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {7096#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7100#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:35:46,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {7100#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7104#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} is VALID [2022-04-08 10:35:46,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {7104#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7108#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= 45 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:35:46,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {7108#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= 45 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7112#(and (= ~SIZE~0 20000001) (= 45 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 48) (= (+ main_~i~0 (- 3)) 48))} is VALID [2022-04-08 10:35:46,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {7112#(and (= ~SIZE~0 20000001) (= 45 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 48) (= (+ main_~i~0 (- 3)) 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7116#(and (= 45 (+ (- 9) main_~k~0)) (= main_~j~0 54) (= (+ main_~i~0 (- 6)) 48) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {7116#(and (= 45 (+ (- 9) main_~k~0)) (= main_~j~0 54) (= (+ main_~i~0 (- 6)) 48) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7120#(and (= (+ (- 9) main_~i~0) 48) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= 57 main_~j~0))} is VALID [2022-04-08 10:35:46,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {7120#(and (= (+ (- 9) main_~i~0) 48) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= 57 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7124#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= 57 (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:35:46,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {7124#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= 57 (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7128#(and (= main_~k~0 63) (= (+ main_~j~0 (- 6)) 57) (= main_~i~0 63) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {7128#(and (= main_~k~0 63) (= (+ main_~j~0 (- 6)) 57) (= main_~i~0 63) (= ~SIZE~0 20000001))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {7128#(and (= main_~k~0 63) (= (+ main_~j~0 (- 6)) 57) (= main_~i~0 63) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {7128#(and (= main_~k~0 63) (= (+ main_~j~0 (- 6)) 57) (= main_~i~0 63) (= ~SIZE~0 20000001))} assume ~n~0 % 4294967296 > 0; {7128#(and (= main_~k~0 63) (= (+ main_~j~0 (- 6)) 57) (= main_~i~0 63) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:35:46,954 INFO L272 TraceCheckUtils]: 30: Hoare triple {7128#(and (= main_~k~0 63) (= (+ main_~j~0 (- 6)) 57) (= main_~i~0 63) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {7138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:35:46,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:35:46,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {7142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7021#false} is VALID [2022-04-08 10:35:46,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {7021#false} assume !false; {7021#false} is VALID [2022-04-08 10:35:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:35:46,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:36:17,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {7021#false} assume !false; {7021#false} is VALID [2022-04-08 10:36:17,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {7142#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7021#false} is VALID [2022-04-08 10:36:17,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7142#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:36:17,562 INFO L272 TraceCheckUtils]: 30: Hoare triple {7158#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {7138#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:36:17,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {7158#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {7158#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {7158#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {7158#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {7168#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7158#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {7172#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7168#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} is VALID [2022-04-08 10:36:17,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {7176#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7172#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} is VALID [2022-04-08 10:36:17,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {7180#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7176#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} is VALID [2022-04-08 10:36:17,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {7184#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7180#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} is VALID [2022-04-08 10:36:17,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {7188#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7184#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} is VALID [2022-04-08 10:36:17,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {7192#(and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7188#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} is VALID [2022-04-08 10:36:17,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {7196#(and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7192#(and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {7200#(and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7196#(and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296)))} is VALID [2022-04-08 10:36:17,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {7204#(and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7200#(and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296)))} is VALID [2022-04-08 10:36:17,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {7208#(and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7204#(and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296))))} is VALID [2022-04-08 10:36:17,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {7212#(and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7208#(and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296)))} is VALID [2022-04-08 10:36:17,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {7216#(and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7212#(and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296)))} is VALID [2022-04-08 10:36:17,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {7220#(and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7216#(and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {7224#(and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7220#(and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296)))} is VALID [2022-04-08 10:36:17,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#(and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7224#(and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)))} is VALID [2022-04-08 10:36:17,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {7232#(and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7228#(and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {7236#(and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7232#(and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)))} is VALID [2022-04-08 10:36:17,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {7240#(and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7236#(and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296)))} is VALID [2022-04-08 10:36:17,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {7244#(and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7240#(and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {7248#(and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7244#(and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296)))} is VALID [2022-04-08 10:36:17,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {7248#(and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:36:17,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:36:17,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:36:17,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {7020#true} #55#return; {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:36:17,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:36:17,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {7020#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; {7252#(not (= (mod (mod 63 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:36:17,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {7020#true} call ULTIMATE.init(); {7020#true} is VALID [2022-04-08 10:36:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:36:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:36:17,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171189110] [2022-04-08 10:36:17,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:36:17,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579724656] [2022-04-08 10:36:17,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579724656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:36:17,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:36:17,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2022-04-08 10:36:17,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:36:17,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966853187] [2022-04-08 10:36:17,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966853187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:36:17,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:36:17,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:36:17,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271521570] [2022-04-08 10:36:17,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:36:17,779 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 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 34 [2022-04-08 10:36:17,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:36:17,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:17,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:36:17,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:36:17,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:36:17,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:36:17,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=1825, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:36:17,894 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:36:28,161 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 10:36:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:36:28,161 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 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 34 [2022-04-08 10:36:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:36:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2022-04-08 10:36:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2022-04-08 10:36:28,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 42 transitions. [2022-04-08 10:36:28,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:36:28,331 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:36:28,331 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:36:28,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=637, Invalid=2015, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:36:28,333 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:36:28,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 10:36:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:36:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 10:36:28,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:36:28,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,346 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,346 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:36:28,346 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 10:36:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 10:36:28,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:36:28,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:36:28,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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 36 states. [2022-04-08 10:36:28,347 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 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 36 states. [2022-04-08 10:36:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:36:28,348 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 10:36:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 10:36:28,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:36:28,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:36:28,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:36:28,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:36:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-08 10:36:28,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-08 10:36:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:36:28,349 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-08 10:36:28,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:36:28,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-08 10:36:28,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:36:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 10:36:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:36:28,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:36:28,556 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:36:28,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 10:36:28,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:36:28,764 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:36:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:36:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash 985249530, now seen corresponding path program 43 times [2022-04-08 10:36:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:36:28,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626035024] [2022-04-08 10:36:28,767 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:36:28,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:36:28,767 INFO L85 PathProgramCache]: Analyzing trace with hash 985249530, now seen corresponding path program 44 times [2022-04-08 10:36:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:36:28,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584447581] [2022-04-08 10:36:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:36:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:36:28,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:36:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287324008] [2022-04-08 10:36:28,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:36:28,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:36:28,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:36:28,786 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:36:28,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 10:36:28,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:36:28,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:36:28,971 WARN L261 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 145 conjunts are in the unsatisfiable core [2022-04-08 10:36:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:36:28,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:36:30,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {7505#true} call ULTIMATE.init(); {7505#true} is VALID [2022-04-08 10:36:30,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {7505#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; {7513#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:36:30,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {7513#(= ~SIZE~0 20000001)} assume true; {7513#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:36:30,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7513#(= ~SIZE~0 20000001)} {7505#true} #55#return; {7513#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:36:30,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {7513#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {7513#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:36:30,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {7513#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7513#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:36:30,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {7513#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {7529#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:36:30,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {7529#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7533#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {7533#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= (+ main_~i~0 (- 3)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7537#(and (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-08 10:36:30,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {7537#(and (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))) (= (+ main_~i~0 (- 6)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7541#(and (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {7541#(and (= (+ main_~i~0 (- 6)) (+ main_~j~0 (- 6))) (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7545#(and (= main_~k~0 12) (= main_~i~0 12) (= 3 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {7545#(and (= main_~k~0 12) (= main_~i~0 12) (= 3 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7549#(and (= (+ main_~j~0 (- 12)) 3) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-08 10:36:30,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {7549#(and (= (+ main_~j~0 (- 12)) 3) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7553#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:36:30,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {7553#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7557#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} is VALID [2022-04-08 10:36:30,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {7557#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7561#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~j~0 24) (= 21 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:36:30,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {7561#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (= main_~j~0 24) (= 21 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7565#(and (= main_~j~0 27) (= main_~i~0 27) (= 21 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {7565#(and (= main_~j~0 27) (= main_~i~0 27) (= 21 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7569#(and (= 30 main_~i~0) (= (+ main_~j~0 (- 3)) 27) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:36:30,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {7569#(and (= 30 main_~i~0) (= (+ main_~j~0 (- 3)) 27) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7573#(and (= 30 (+ main_~k~0 (- 3))) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {7573#(and (= 30 (+ main_~k~0 (- 3))) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7577#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:36:30,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {7577#(and (= main_~k~0 36) (= main_~j~0 36) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7581#(and (= main_~j~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 36))} is VALID [2022-04-08 10:36:30,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {7581#(and (= main_~j~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7585#(and (= 42 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 39) (= 42 main_~j~0))} is VALID [2022-04-08 10:36:30,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {7585#(and (= 42 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 39) (= 42 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7589#(and (= (+ main_~i~0 (- 6)) 39) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} is VALID [2022-04-08 10:36:30,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {7589#(and (= (+ main_~i~0 (- 6)) 39) (= ~SIZE~0 20000001) (= main_~j~0 45) (= main_~k~0 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7593#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= main_~k~0 48))} is VALID [2022-04-08 10:36:30,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {7593#(and (= main_~j~0 48) (= main_~i~0 48) (= ~SIZE~0 20000001) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7597#(and (= (+ main_~k~0 (- 3)) 48) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {7597#(and (= (+ main_~k~0 (- 3)) 48) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7601#(and (= 48 (+ main_~k~0 (- 6))) (= main_~j~0 54) (= ~SIZE~0 20000001) (= main_~i~0 54))} is VALID [2022-04-08 10:36:30,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {7601#(and (= 48 (+ main_~k~0 (- 6))) (= main_~j~0 54) (= ~SIZE~0 20000001) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7605#(and (= (+ main_~i~0 (- 3)) 54) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 54))} is VALID [2022-04-08 10:36:30,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {7605#(and (= (+ main_~i~0 (- 3)) 54) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 3)) 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7609#(and (= 57 (+ main_~k~0 (- 3))) (= main_~j~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60))} is VALID [2022-04-08 10:36:30,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {7609#(and (= 57 (+ main_~k~0 (- 3))) (= main_~j~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7613#(and (= main_~j~0 63) (= main_~k~0 63) (= (+ main_~i~0 (- 3)) 60) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:36:30,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {7613#(and (= main_~j~0 63) (= main_~k~0 63) (= (+ main_~i~0 (- 3)) 60) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7617#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0))} is VALID [2022-04-08 10:36:30,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {7617#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {7621#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= 66 main_~k~0))} is VALID [2022-04-08 10:36:30,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {7621#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= 66 main_~k~0))} assume ~n~0 % 4294967296 > 0; {7617#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0))} is VALID [2022-04-08 10:36:30,056 INFO L272 TraceCheckUtils]: 31: Hoare triple {7617#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {7628#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:36:30,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {7628#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7632#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:36:30,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {7632#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7506#false} is VALID [2022-04-08 10:36:30,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {7506#false} assume !false; {7506#false} is VALID [2022-04-08 10:36:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:36:30,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:37:15,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {7506#false} assume !false; {7506#false} is VALID [2022-04-08 10:37:15,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {7632#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7506#false} is VALID [2022-04-08 10:37:15,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {7628#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7632#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:37:15,730 INFO L272 TraceCheckUtils]: 31: Hoare triple {7648#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {7628#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:37:15,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {7652#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {7648#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:37:15,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {7656#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {7652#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:37:15,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {7660#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7656#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {7664#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7660#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {7668#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7664#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:37:15,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {7672#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7668#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:37:15,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {7676#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7672#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:37:15,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {7680#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7676#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:37:15,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {7684#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7680#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:37:15,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {7688#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7684#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {7692#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7688#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {7696#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7692#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:37:15,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {7700#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7696#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:37:15,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {7704#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7700#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {7708#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7704#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:37:15,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {7712#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7708#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {7716#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7712#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:37:15,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {7720#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7716#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:37:15,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {7724#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7720#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {7728#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7724#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:15,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {7732#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7728#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} is VALID [2022-04-08 10:37:15,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {7736#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7732#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:16,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {7740#(or (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 63) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7736#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:16,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {7744#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {7740#(or (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 63) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:16,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {7744#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:37:16,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:37:16,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:37:16,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {7505#true} #55#return; {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:37:16,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:37:16,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {7505#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; {7748#(not (= (mod (mod 66 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:37:16,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {7505#true} call ULTIMATE.init(); {7505#true} is VALID [2022-04-08 10:37:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:37:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:37:16,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584447581] [2022-04-08 10:37:16,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:37:16,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287324008] [2022-04-08 10:37:16,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287324008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:37:16,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:37:16,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 55 [2022-04-08 10:37:16,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:37:16,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1626035024] [2022-04-08 10:37:16,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1626035024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:37:16,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:37:16,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:37:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98677120] [2022-04-08 10:37:16,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:37:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-08 10:37:16,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:37:16,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:16,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:37:16,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:37:16,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:37:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:37:16,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:37:16,137 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:37:29,353 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 10:37:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:37:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-08 10:37:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:37:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-08 10:37:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-08 10:37:29,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-08 10:37:29,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:37:29,497 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:37:29,497 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 10:37:29,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=769, Invalid=2423, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 10:37:29,498 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:37:29,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-04-08 10:37:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 10:37:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 10:37:29,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:37:29,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,508 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,508 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:37:29,508 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 10:37:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 10:37:29,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:37:29,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:37:29,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 37 states. [2022-04-08 10:37:29,509 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 37 states. [2022-04-08 10:37:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:37:29,509 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 10:37:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 10:37:29,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:37:29,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:37:29,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:37:29,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:37:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-08 10:37:29,510 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-08 10:37:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:37:29,510 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-08 10:37:29,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:37:29,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-08 10:37:29,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:37:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 10:37:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:37:29,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:37:29,738 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:37:29,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 10:37:29,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:37:29,940 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:37:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:37:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2003022331, now seen corresponding path program 45 times [2022-04-08 10:37:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:37:29,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167971104] [2022-04-08 10:37:29,943 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:37:29,943 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:37:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2003022331, now seen corresponding path program 46 times [2022-04-08 10:37:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:37:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974199786] [2022-04-08 10:37:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:37:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:37:29,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:37:29,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571644708] [2022-04-08 10:37:29,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:37:29,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:37:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:37:29,981 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:37:30,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 10:37:30,100 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:37:30,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:37:30,103 WARN L261 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 149 conjunts are in the unsatisfiable core [2022-04-08 10:37:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:37:30,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:37:30,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {8007#true} call ULTIMATE.init(); {8007#true} is VALID [2022-04-08 10:37:30,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {8007#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; {8015#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:37:30,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {8015#(= ~SIZE~0 20000001)} assume true; {8015#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:37:30,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8015#(= ~SIZE~0 20000001)} {8007#true} #55#return; {8015#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:37:30,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {8015#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {8015#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:37:30,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {8015#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {8015#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:37:30,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {8015#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {8031#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:37:30,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {8031#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8035#(and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {8035#(and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8039#(and (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6))} is VALID [2022-04-08 10:37:30,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {8039#(and (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6) (= main_~k~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8043#(and (= 6 (+ main_~k~0 (- 3))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 10:37:30,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {8043#(and (= 6 (+ main_~k~0 (- 3))) (= main_~j~0 9) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8047#(and (= main_~j~0 12) (= (+ main_~i~0 (- 6)) 6) (= 6 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {8047#(and (= main_~j~0 12) (= (+ main_~i~0 (- 6)) 6) (= 6 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8051#(and (= 6 (+ (- 9) main_~i~0)) (= 6 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (= main_~j~0 15))} is VALID [2022-04-08 10:37:30,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {8051#(and (= 6 (+ (- 9) main_~i~0)) (= 6 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (= main_~j~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8055#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 12)) 6))} is VALID [2022-04-08 10:37:30,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {8055#(and (= main_~k~0 18) (= main_~j~0 18) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 12)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8059#(and (= (+ (- 15) main_~i~0) 6) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~j~0 (- 3)) 18))} is VALID [2022-04-08 10:37:30,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {8059#(and (= (+ (- 15) main_~i~0) 6) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~j~0 (- 3)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8063#(and (= 6 (+ main_~i~0 (- 18))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 18) (= main_~k~0 24))} is VALID [2022-04-08 10:37:30,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {8063#(and (= 6 (+ main_~i~0 (- 18))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 18) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8067#(and (= (+ main_~k~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001) (= (+ (- 9) main_~j~0) 18))} is VALID [2022-04-08 10:37:30,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {8067#(and (= (+ main_~k~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001) (= (+ (- 9) main_~j~0) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8071#(and (= 30 main_~j~0) (= 30 main_~i~0) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {8071#(and (= 30 main_~j~0) (= 30 main_~i~0) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8075#(and (= main_~k~0 33) (= main_~j~0 33) (= ~SIZE~0 20000001) (= main_~i~0 33))} is VALID [2022-04-08 10:37:30,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(and (= main_~k~0 33) (= main_~j~0 33) (= ~SIZE~0 20000001) (= main_~i~0 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8079#(and (= (+ main_~i~0 (- 3)) 33) (= (+ main_~j~0 (- 3)) 33) (= (+ main_~k~0 (- 3)) 33) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {8079#(and (= (+ main_~i~0 (- 3)) 33) (= (+ main_~j~0 (- 3)) 33) (= (+ main_~k~0 (- 3)) 33) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8083#(and (= main_~j~0 39) (= (+ main_~i~0 (- 6)) 33) (= main_~k~0 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {8083#(and (= main_~j~0 39) (= (+ main_~i~0 (- 6)) 33) (= main_~k~0 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8087#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:37:30,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {8087#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8091#(and (= 39 (+ main_~k~0 (- 6))) (= main_~i~0 45) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} is VALID [2022-04-08 10:37:30,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {8091#(and (= 39 (+ main_~k~0 (- 6))) (= main_~i~0 45) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8095#(and (= (+ main_~i~0 (- 3)) 45) (= 39 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= main_~k~0 48))} is VALID [2022-04-08 10:37:30,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {8095#(and (= (+ main_~i~0 (- 3)) 45) (= 39 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8099#(and (= 51 main_~k~0) (= (+ main_~j~0 (- 12)) 39) (= 51 main_~i~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {8099#(and (= 51 main_~k~0) (= (+ main_~j~0 (- 12)) 39) (= 51 main_~i~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8103#(and (= 39 (+ (- 15) main_~j~0)) (= ~SIZE~0 20000001) (= 51 (+ main_~k~0 (- 3))) (= main_~i~0 54))} is VALID [2022-04-08 10:37:30,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {8103#(and (= 39 (+ (- 15) main_~j~0)) (= ~SIZE~0 20000001) (= 51 (+ main_~k~0 (- 3))) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8107#(and (= (+ main_~i~0 (- 3)) 54) (= 57 main_~k~0) (= (+ main_~j~0 (- 18)) 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {8107#(and (= (+ main_~i~0 (- 3)) 54) (= 57 main_~k~0) (= (+ main_~j~0 (- 18)) 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8111#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= 39 (+ main_~j~0 (- 21))) (= (+ main_~i~0 (- 6)) 54))} is VALID [2022-04-08 10:37:30,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {8111#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= 39 (+ main_~j~0 (- 21))) (= (+ main_~i~0 (- 6)) 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8115#(and (= main_~k~0 63) (= (+ main_~j~0 (- 24)) 39) (= main_~i~0 63) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:37:30,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {8115#(and (= main_~k~0 63) (= (+ main_~j~0 (- 24)) 39) (= main_~i~0 63) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8119#(and (= (+ main_~i~0 (- 3)) 63) (= (+ main_~k~0 (- 3)) 63) (= ~SIZE~0 20000001) (= (+ (- 27) main_~j~0) 39))} is VALID [2022-04-08 10:37:30,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {8119#(and (= (+ main_~i~0 (- 3)) 63) (= (+ main_~k~0 (- 3)) 63) (= ~SIZE~0 20000001) (= (+ (- 27) main_~j~0) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8123#(and (= (+ main_~j~0 (- 30)) 39) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 63) (= 63 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:37:30,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {8123#(and (= (+ main_~j~0 (- 30)) 39) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 63) (= 63 (+ main_~k~0 (- 6))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {8123#(and (= (+ main_~j~0 (- 30)) 39) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 63) (= 63 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:37:30,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {8123#(and (= (+ main_~j~0 (- 30)) 39) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 63) (= 63 (+ main_~k~0 (- 6))))} assume ~n~0 % 4294967296 > 0; {8123#(and (= (+ main_~j~0 (- 30)) 39) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 63) (= 63 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:37:30,981 INFO L272 TraceCheckUtils]: 32: Hoare triple {8123#(and (= (+ main_~j~0 (- 30)) 39) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 63) (= 63 (+ main_~k~0 (- 6))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {8133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:37:30,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {8133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:37:30,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {8137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8008#false} is VALID [2022-04-08 10:37:30,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {8008#false} assume !false; {8008#false} is VALID [2022-04-08 10:37:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:37:30,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:38:11,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {8008#false} assume !false; {8008#false} is VALID [2022-04-08 10:38:11,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {8137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8008#false} is VALID [2022-04-08 10:38:11,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {8133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:38:11,176 INFO L272 TraceCheckUtils]: 32: Hoare triple {8153#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {8133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:38:11,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {8153#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume ~n~0 % 4294967296 > 0; {8153#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {8153#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {8153#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {8163#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8153#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {8167#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8163#(and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296)))} is VALID [2022-04-08 10:38:11,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {8171#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8167#(and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)))} is VALID [2022-04-08 10:38:11,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {8175#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8171#(and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296)))} is VALID [2022-04-08 10:38:11,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {8179#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8175#(and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)))} is VALID [2022-04-08 10:38:11,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {8183#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8179#(and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296)))} is VALID [2022-04-08 10:38:11,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {8187#(and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8183#(and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296)))} is VALID [2022-04-08 10:38:11,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {8191#(and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8187#(and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {8195#(and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8191#(and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296)))} is VALID [2022-04-08 10:38:11,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {8199#(and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8195#(and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296)))} is VALID [2022-04-08 10:38:11,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {8203#(and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8199#(and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296))))} is VALID [2022-04-08 10:38:11,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {8207#(and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8203#(and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296)))} is VALID [2022-04-08 10:38:11,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {8211#(and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8207#(and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296)))} is VALID [2022-04-08 10:38:11,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {8215#(and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8211#(and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {8219#(and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8215#(and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296)))} is VALID [2022-04-08 10:38:11,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {8223#(and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8219#(and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)))} is VALID [2022-04-08 10:38:11,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {8227#(and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8223#(and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {8231#(and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8227#(and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)))} is VALID [2022-04-08 10:38:11,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {8235#(and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8231#(and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296)))} is VALID [2022-04-08 10:38:11,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {8239#(and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8235#(and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {8243#(and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8239#(and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296)))} is VALID [2022-04-08 10:38:11,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {8247#(and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8243#(and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:38:11,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {8251#(and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8247#(and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296)))} is VALID [2022-04-08 10:38:11,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {8251#(and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)))} is VALID [2022-04-08 10:38:11,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:38:11,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:38:11,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {8007#true} #55#return; {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:38:11,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:38:11,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {8007#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; {8255#(not (= (mod (mod 69 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:38:11,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {8007#true} call ULTIMATE.init(); {8007#true} is VALID [2022-04-08 10:38:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:38:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:38:11,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974199786] [2022-04-08 10:38:11,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:38:11,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571644708] [2022-04-08 10:38:11,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571644708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:38:11,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:38:11,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 54 [2022-04-08 10:38:11,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:38:11,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167971104] [2022-04-08 10:38:11,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167971104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:38:11,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:38:11,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:38:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125450551] [2022-04-08 10:38:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:38:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 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 36 [2022-04-08 10:38:11,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:38:11,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:11,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:11,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:38:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:38:11,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=2133, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:38:11,555 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:26,027 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 10:38:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:38:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 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 36 [2022-04-08 10:38:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:38:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2022-04-08 10:38:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2022-04-08 10:38:26,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 44 transitions. [2022-04-08 10:38:26,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:26,202 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:38:26,202 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:38:26,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=741, Invalid=2339, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:38:26,203 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:38:26,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-04-08 10:38:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:38:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 10:38:26,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:38:26,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,213 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,213 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:26,214 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 10:38:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 10:38:26,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:26,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:26,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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 38 states. [2022-04-08 10:38:26,215 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 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 38 states. [2022-04-08 10:38:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:38:26,215 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 10:38:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 10:38:26,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:38:26,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:38:26,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:38:26,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:38:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-08 10:38:26,217 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-08 10:38:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:38:26,217 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-08 10:38:26,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:38:26,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-08 10:38:26,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:38:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 10:38:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:38:26,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:38:26,448 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:38:26,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 10:38:26,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:38:26,648 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:38:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:38:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -805759206, now seen corresponding path program 47 times [2022-04-08 10:38:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:38:26,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811329644] [2022-04-08 10:38:26,652 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:38:26,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:38:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -805759206, now seen corresponding path program 48 times [2022-04-08 10:38:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:38:26,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556086474] [2022-04-08 10:38:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:38:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:38:26,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:38:26,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923822697] [2022-04-08 10:38:26,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:38:26,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:38:26,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:38:26,678 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:38:26,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 10:38:28,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 10:38:28,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:38:28,116 WARN L261 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-08 10:38:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:38:28,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:38:30,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {8520#true} call ULTIMATE.init(); {8520#true} is VALID [2022-04-08 10:38:30,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {8520#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; {8528#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:38:30,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {8528#(= ~SIZE~0 20000001)} assume true; {8528#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:38:30,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8528#(= ~SIZE~0 20000001)} {8520#true} #55#return; {8528#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:38:30,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {8528#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {8528#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:38:30,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {8528#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {8528#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:38:30,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {8528#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {8544#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:38:30,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {8544#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8548#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {8548#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8552#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {8552#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8556#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {8556#(and (= (+ (- 9) main_~i~0) 0) (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8560#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:38:30,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {8560#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8564#(and (= (+ (- 15) main_~j~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:38:30,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {8564#(and (= (+ (- 15) main_~j~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8568#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))) (= (+ main_~j~0 (- 18)) 0))} is VALID [2022-04-08 10:38:30,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {8568#(and (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))) (= (+ main_~j~0 (- 18)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8572#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~j~0 21))} is VALID [2022-04-08 10:38:30,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {8572#(and (= main_~i~0 21) (= main_~k~0 21) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8576#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~j~0 24) (= main_~k~0 24))} is VALID [2022-04-08 10:38:30,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {8576#(and (= main_~i~0 24) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~j~0 24) (= main_~k~0 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8580#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {8580#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8584#(and (= 30 main_~i~0) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-08 10:38:30,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {8584#(and (= 30 main_~i~0) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~j~0 (- 6)) 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8588#(and (= (+ (- 9) main_~k~0) 24) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 33) (= (+ (- 9) main_~j~0) 24))} is VALID [2022-04-08 10:38:30,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {8588#(and (= (+ (- 9) main_~k~0) 24) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 33) (= (+ (- 9) main_~j~0) 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8592#(and (= (+ main_~i~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 12)) 24))} is VALID [2022-04-08 10:38:30,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {8592#(and (= (+ main_~i~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 12)) 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8596#(and (= (+ main_~j~0 (- 3)) 36) (= (+ main_~i~0 (- 6)) 33) (= main_~k~0 39) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {8596#(and (= (+ main_~j~0 (- 3)) 36) (= (+ main_~i~0 (- 6)) 33) (= main_~k~0 39) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8600#(and (= (+ (- 9) main_~i~0) 33) (= 42 main_~k~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 42 main_~j~0))} is VALID [2022-04-08 10:38:30,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {8600#(and (= (+ (- 9) main_~i~0) 33) (= 42 main_~k~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 42 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8604#(and (= (+ main_~j~0 (- 3)) 42) (= 42 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 12)) 33))} is VALID [2022-04-08 10:38:30,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {8604#(and (= (+ main_~j~0 (- 3)) 42) (= 42 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 12)) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8608#(and (= (+ (- 15) main_~i~0) 33) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 42 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 6)) 42))} is VALID [2022-04-08 10:38:30,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {8608#(and (= (+ (- 15) main_~i~0) 33) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 42 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 6)) 42))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8612#(and (= 51 main_~j~0) (= 42 (+ (- 9) main_~k~0)) (= 51 main_~i~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {8612#(and (= 51 main_~j~0) (= 42 (+ (- 9) main_~k~0)) (= 51 main_~i~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8616#(and (= main_~k~0 54) (= main_~j~0 54) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 54))} is VALID [2022-04-08 10:38:30,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {8616#(and (= main_~k~0 54) (= main_~j~0 54) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8620#(and (= 57 main_~i~0) (= (+ main_~k~0 (- 3)) 54) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~j~0 (- 3)) 54))} is VALID [2022-04-08 10:38:30,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {8620#(and (= 57 main_~i~0) (= (+ main_~k~0 (- 3)) 54) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~j~0 (- 3)) 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8624#(and (= (+ main_~i~0 (- 3)) 57) (= main_~j~0 60) (= (+ main_~k~0 (- 6)) 54) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:38:30,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {8624#(and (= (+ main_~i~0 (- 3)) 57) (= main_~j~0 60) (= (+ main_~k~0 (- 6)) 54) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8628#(and (= main_~j~0 63) (= main_~i~0 63) (< 57 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 54 (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:38:30,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {8628#(and (= main_~j~0 63) (= main_~i~0 63) (< 57 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 54 (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8632#(and (= (+ main_~j~0 (- 3)) 63) (= (+ main_~i~0 (- 3)) 63) (< 57 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 12)) 54))} is VALID [2022-04-08 10:38:30,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {8632#(and (= (+ main_~j~0 (- 3)) 63) (= (+ main_~i~0 (- 3)) 63) (< 57 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 12)) 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8636#(and (= (+ main_~j~0 (- 6)) 63) (= (+ (- 15) main_~k~0) 54) (< 57 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 6)) 63))} is VALID [2022-04-08 10:38:30,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {8636#(and (= (+ main_~j~0 (- 6)) 63) (= (+ (- 15) main_~k~0) 54) (< 57 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 6)) 63))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8640#(and (= 72 main_~i~0) (= 72 main_~j~0) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 72 main_~k~0))} is VALID [2022-04-08 10:38:30,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {8640#(and (= 72 main_~i~0) (= 72 main_~j~0) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 72 main_~k~0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {8644#(and (= 72 main_~i~0) (= 72 main_~j~0) (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 72 main_~k~0))} is VALID [2022-04-08 10:38:30,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {8644#(and (= 72 main_~i~0) (= 72 main_~j~0) (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 72 main_~k~0))} assume ~n~0 % 4294967296 > 0; {8648#(and (= 72 main_~i~0) (= 72 main_~j~0) (= ~SIZE~0 20000001) (= 72 main_~k~0))} is VALID [2022-04-08 10:38:30,485 INFO L272 TraceCheckUtils]: 33: Hoare triple {8648#(and (= 72 main_~i~0) (= 72 main_~j~0) (= ~SIZE~0 20000001) (= 72 main_~k~0))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {8652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:38:30,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {8652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:38:30,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {8656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8521#false} is VALID [2022-04-08 10:38:30,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {8521#false} assume !false; {8521#false} is VALID [2022-04-08 10:38:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:38:30,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:39:09,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {8521#false} assume !false; {8521#false} is VALID [2022-04-08 10:39:09,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {8656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8521#false} is VALID [2022-04-08 10:39:09,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {8652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:39:09,465 INFO L272 TraceCheckUtils]: 33: Hoare triple {8672#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {8652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:39:09,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {8676#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {8672#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:39:09,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {8680#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {8676#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:39:09,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {8684#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8680#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {8688#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 3) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8684#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)))} is VALID [2022-04-08 10:39:09,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {8692#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 6) 4294967296)) (< (mod (+ main_~i~0 9) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8688#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 3) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {8696#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 9) 4294967296)) (< (mod (+ main_~i~0 12) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8692#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 6) 4294967296)) (< (mod (+ main_~i~0 9) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:39:09,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {8700#(or (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 15) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 12) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8696#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 9) 4294967296)) (< (mod (+ main_~i~0 12) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:39:09,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {8704#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 15) 4294967296)) (< (mod (+ main_~i~0 18) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8700#(or (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 15) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 12) 4294967296)))} is VALID [2022-04-08 10:39:09,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {8708#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod (+ main_~i~0 21) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 18) 4294967296)) (not (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8704#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 15) 4294967296)) (< (mod (+ main_~i~0 18) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:39:09,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {8712#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (< (mod (+ main_~i~0 24) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 21) 4294967296)) (not (< (mod (+ main_~i~0 9) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8708#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod (+ main_~i~0 21) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 18) 4294967296)) (not (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:39:09,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {8716#(or (not (< (mod (+ main_~i~0 12) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 24) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))) (< (mod (+ main_~i~0 27) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8712#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (< (mod (+ main_~i~0 24) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 21) 4294967296)) (not (< (mod (+ main_~i~0 9) 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:39:09,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {8720#(or (not (< (mod (+ main_~i~0 15) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 27) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))) (< (mod (+ 30 main_~i~0) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8716#(or (not (< (mod (+ main_~i~0 12) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 24) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))) (< (mod (+ main_~i~0 27) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {8724#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (< (mod (+ main_~i~0 33) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 18) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8720#(or (not (< (mod (+ main_~i~0 15) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 27) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))) (< (mod (+ 30 main_~i~0) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {8728#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 33) 4294967296)) (< (mod (+ main_~i~0 36) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 21) 4294967296) (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8724#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (< (mod (+ main_~i~0 33) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 18) 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:39:09,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {8732#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 36) 4294967296)) (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< (mod (+ main_~i~0 24) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 39) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8728#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 33) 4294967296)) (< (mod (+ main_~i~0 36) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 21) 4294967296) (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:39:09,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {8736#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 39) 4294967296)) (not (< (mod (+ main_~i~0 27) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ 42 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8732#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 36) 4294967296)) (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< (mod (+ main_~i~0 24) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 39) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {8740#(or (< (mod (+ main_~i~0 45) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (not (< (mod (+ 30 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8736#(or (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 39) 4294967296)) (not (< (mod (+ main_~i~0 27) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ 42 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:39:09,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {8744#(or (not (< (mod (+ main_~i~0 33) 4294967296) (mod main_~n~0 4294967296))) (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 45) 4294967296)) (< (mod (+ main_~i~0 48) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8740#(or (< (mod (+ main_~i~0 45) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (not (< (mod (+ 30 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:39:09,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {8748#(or (< (mod (+ 51 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (not (< (mod (+ main_~i~0 36) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 48) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8744#(or (not (< (mod (+ main_~i~0 33) 4294967296) (mod main_~n~0 4294967296))) (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 45) 4294967296)) (< (mod (+ main_~i~0 48) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {8752#(or (< (mod (+ main_~i~0 54) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ 51 main_~i~0) 4294967296)) (not (< (mod (+ main_~i~0 39) 4294967296) (mod main_~n~0 4294967296))) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8748#(or (< (mod (+ 51 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (not (< (mod (+ main_~i~0 36) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 48) 4294967296)))} is VALID [2022-04-08 10:39:09,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {8756#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< (mod (+ 42 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 54) 4294967296)) (< (mod (+ 57 main_~i~0) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8752#(or (< (mod (+ main_~i~0 54) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ 51 main_~i~0) 4294967296)) (not (< (mod (+ main_~i~0 39) 4294967296) (mod main_~n~0 4294967296))) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} is VALID [2022-04-08 10:39:09,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {8760#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (not (< (mod (+ main_~i~0 45) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ 57 main_~i~0) 4294967296)) (< (mod (+ main_~i~0 60) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8756#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< (mod (+ 42 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 54) 4294967296)) (< (mod (+ 57 main_~i~0) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {8764#(or (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 60) 4294967296)) (< (mod (+ main_~i~0 63) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 48) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8760#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (not (< (mod (+ main_~i~0 45) 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod (+ 57 main_~i~0) 4294967296)) (< (mod (+ main_~i~0 60) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:39:09,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {8768#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (not (< (mod (+ 51 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ 66 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 63) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8764#(or (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 60) 4294967296)) (< (mod (+ main_~i~0 63) 4294967296) (mod main_~n~0 4294967296)) (not (< (mod (+ main_~i~0 48) 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:39:09,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {8772#(or (<= (mod main_~n~0 4294967296) (mod (+ 66 main_~i~0) 4294967296)) (< (mod (+ main_~i~0 69) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296))) (not (< (mod (+ main_~i~0 54) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8768#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (not (< (mod (+ 51 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ 66 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 63) 4294967296)))} is VALID [2022-04-08 10:39:09,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {8776#(or (not (< (mod (+ 57 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ 72 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 69) 4294967296)) (and (not (= (mod (mod (mod (+ 72 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 72 main_~k~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296)) (= (mod (+ 72 main_~i~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {8772#(or (<= (mod main_~n~0 4294967296) (mod (+ 66 main_~i~0) 4294967296)) (< (mod (+ main_~i~0 69) 4294967296) (mod main_~n~0 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296))) (not (< (mod (+ main_~i~0 54) 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:39:09,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {8776#(or (not (< (mod (+ 57 main_~i~0) 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ 72 main_~i~0) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ main_~i~0 69) 4294967296)) (and (not (= (mod (mod (mod (+ 72 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 72 main_~k~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296)) (= (mod (+ 72 main_~i~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:39:09,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:39:09,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call #t~ret5 := main(); {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:39:09,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} {8520#true} #55#return; {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:39:09,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} assume true; {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:39:09,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {8520#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; {8780#(or (<= (div (+ (* (- 1) (mod ~SIZE~0 4294967296)) 69) (- 4294967296)) 0) (not (= (mod (mod 72 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:39:09,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {8520#true} call ULTIMATE.init(); {8520#true} is VALID [2022-04-08 10:39:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:39:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:39:09,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556086474] [2022-04-08 10:39:09,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:39:09,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923822697] [2022-04-08 10:39:09,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923822697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:39:09,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:39:09,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 60 [2022-04-08 10:39:09,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:39:09,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811329644] [2022-04-08 10:39:09,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811329644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:39:09,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:39:09,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 10:39:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330237959] [2022-04-08 10:39:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:39:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 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 37 [2022-04-08 10:39:09,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:39:09,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:10,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:39:10,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 10:39:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:39:10,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 10:39:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=2635, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:39:10,023 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:39:27,788 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 10:39:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:39:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 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 37 [2022-04-08 10:39:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:39:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-08 10:39:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-08 10:39:27,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-08 10:39:27,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:39:27,993 INFO L225 Difference]: With dead ends: 45 [2022-04-08 10:39:27,993 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 10:39:27,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=917, Invalid=2865, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:39:27,994 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:39:27,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-04-08 10:39:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 10:39:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 10:39:28,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:39:28,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:28,021 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:28,021 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:39:28,022 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 10:39:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 10:39:28,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:39:28,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:39:28,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 39 states. [2022-04-08 10:39:28,022 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 39 states. [2022-04-08 10:39:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:39:28,023 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 10:39:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 10:39:28,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:39:28,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:39:28,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:39:28,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:39:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-08 10:39:28,024 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-08 10:39:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:39:28,025 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-08 10:39:28,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:39:28,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-08 10:39:28,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:39:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 10:39:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:39:28,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:39:28,270 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:39:28,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 10:39:28,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 10:39:28,471 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:39:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:39:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1978640933, now seen corresponding path program 49 times [2022-04-08 10:39:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:39:28,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890074102] [2022-04-08 10:39:28,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:39:28,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:39:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1978640933, now seen corresponding path program 50 times [2022-04-08 10:39:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:39:28,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798790694] [2022-04-08 10:39:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:39:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:39:28,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:39:28,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964899941] [2022-04-08 10:39:28,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:39:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:39:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:39:28,496 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:39:28,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 10:39:28,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:39:28,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:39:28,907 WARN L261 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 163 conjunts are in the unsatisfiable core [2022-04-08 10:39:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:39:28,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:39:30,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {9051#true} call ULTIMATE.init(); {9051#true} is VALID [2022-04-08 10:39:30,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {9051#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; {9059#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:39:30,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {9059#(= ~SIZE~0 20000001)} assume true; {9059#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:39:30,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9059#(= ~SIZE~0 20000001)} {9051#true} #55#return; {9059#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:39:30,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {9059#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {9059#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:39:30,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {9059#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {9059#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:39:30,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {9059#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {9075#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:39:30,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {9075#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9079#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:39:30,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {9079#(and (= main_~i~0 main_~j~0) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9083#(and (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} is VALID [2022-04-08 10:39:30,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {9083#(and (= main_~i~0 6) (= (+ main_~j~0 (- 3)) 3) (= ~SIZE~0 20000001) (= main_~k~0 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9087#(and (= 6 (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-08 10:39:30,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {9087#(and (= 6 (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 3) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9091#(and (= main_~k~0 12) (= main_~i~0 12) (= 3 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:39:30,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {9091#(and (= main_~k~0 12) (= main_~i~0 12) (= 3 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9095#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} is VALID [2022-04-08 10:39:30,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {9095#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (= main_~j~0 15) (= (+ main_~k~0 (- 3)) 12))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9099#(and (= (+ main_~j~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} is VALID [2022-04-08 10:39:30,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {9099#(and (= (+ main_~j~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9103#(and (= (+ main_~j~0 (- 6)) 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~i~0 (- 3)) 18))} is VALID [2022-04-08 10:39:30,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {9103#(and (= (+ main_~j~0 (- 6)) 15) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~i~0 (- 3)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9107#(and (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 6)) 18))} is VALID [2022-04-08 10:39:30,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {9107#(and (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 6)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9111#(and (= (+ main_~j~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001) (= (+ (- 9) main_~i~0) 18))} is VALID [2022-04-08 10:39:30,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {9111#(and (= (+ main_~j~0 (- 3)) 24) (= main_~k~0 27) (= ~SIZE~0 20000001) (= (+ (- 9) main_~i~0) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9115#(and (= 30 main_~i~0) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-08 10:39:30,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {9115#(and (= 30 main_~i~0) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 27) (= (+ main_~j~0 (- 6)) 24))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9119#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:39:30,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {9119#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9123#(and (= (+ main_~j~0 (- 3)) 33) (= (+ main_~k~0 (- 3)) 33) (= ~SIZE~0 20000001) (= main_~i~0 36))} is VALID [2022-04-08 10:39:30,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {9123#(and (= (+ main_~j~0 (- 3)) 33) (= (+ main_~k~0 (- 3)) 33) (= ~SIZE~0 20000001) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9127#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:39:30,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {9127#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9131#(and (= 42 main_~k~0) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:39:30,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {9131#(and (= 42 main_~k~0) (= ~SIZE~0 20000001) (= 42 main_~i~0) (= (+ main_~j~0 (- 3)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9135#(and (= 42 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} is VALID [2022-04-08 10:39:30,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {9135#(and (= 42 (+ main_~k~0 (- 3))) (= (+ main_~i~0 (- 3)) 42) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9139#(and (= 39 (+ (- 9) main_~j~0)) (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:39:30,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {9139#(and (= 39 (+ (- 9) main_~j~0)) (= (+ main_~i~0 (- 6)) 42) (= ~SIZE~0 20000001) (= 42 (+ main_~k~0 (- 6))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9143#(and (= 42 (+ (- 9) main_~i~0)) (= (+ main_~j~0 (- 12)) 39) (= 42 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:39:30,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {9143#(and (= 42 (+ (- 9) main_~i~0)) (= (+ main_~j~0 (- 12)) 39) (= 42 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9147#(and (= 39 (+ (- 15) main_~j~0)) (= (+ main_~k~0 (- 12)) 42) (= ~SIZE~0 20000001) (= main_~i~0 54))} is VALID [2022-04-08 10:39:30,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {9147#(and (= 39 (+ (- 15) main_~j~0)) (= (+ main_~k~0 (- 12)) 42) (= ~SIZE~0 20000001) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9151#(and (= (+ main_~i~0 (- 3)) 54) (= 57 main_~k~0) (= (+ main_~j~0 (- 18)) 39) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:39:30,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {9151#(and (= (+ main_~i~0 (- 3)) 54) (= 57 main_~k~0) (= (+ main_~j~0 (- 18)) 39) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9155#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= 39 (+ main_~j~0 (- 21))))} is VALID [2022-04-08 10:39:30,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {9155#(and (= main_~k~0 60) (= ~SIZE~0 20000001) (= main_~i~0 60) (= 39 (+ main_~j~0 (- 21))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9159#(and (= main_~k~0 63) (= (+ main_~j~0 (- 24)) 39) (= main_~i~0 63) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:39:30,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {9159#(and (= main_~k~0 63) (= (+ main_~j~0 (- 24)) 39) (= main_~i~0 63) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9163#(and (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0) (= (+ (- 27) main_~j~0) 39))} is VALID [2022-04-08 10:39:30,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {9163#(and (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0) (= (+ (- 27) main_~j~0) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9167#(and (= (+ main_~i~0 (- 3)) 66) (= main_~k~0 69) (= ~SIZE~0 20000001) (= main_~j~0 69))} is VALID [2022-04-08 10:39:30,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {9167#(and (= (+ main_~i~0 (- 3)) 66) (= main_~k~0 69) (= ~SIZE~0 20000001) (= main_~j~0 69))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9171#(and (= 72 main_~i~0) (= 72 main_~j~0) (= ~SIZE~0 20000001) (= 69 (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:39:30,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {9171#(and (= 72 main_~i~0) (= 72 main_~j~0) (= ~SIZE~0 20000001) (= 69 (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9175#(and (= ~SIZE~0 20000001) (= main_~j~0 75) (= (+ main_~i~0 (- 3)) 72) (= 69 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:39:30,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {9175#(and (= ~SIZE~0 20000001) (= main_~j~0 75) (= (+ main_~i~0 (- 3)) 72) (= 69 (+ main_~k~0 (- 6))))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {9179#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 75) (= (+ main_~i~0 (- 3)) 72) (= 69 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:39:30,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {9179#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= main_~j~0 75) (= (+ main_~i~0 (- 3)) 72) (= 69 (+ main_~k~0 (- 6))))} assume ~n~0 % 4294967296 > 0; {9175#(and (= ~SIZE~0 20000001) (= main_~j~0 75) (= (+ main_~i~0 (- 3)) 72) (= 69 (+ main_~k~0 (- 6))))} is VALID [2022-04-08 10:39:30,151 INFO L272 TraceCheckUtils]: 34: Hoare triple {9175#(and (= ~SIZE~0 20000001) (= main_~j~0 75) (= (+ main_~i~0 (- 3)) 72) (= 69 (+ main_~k~0 (- 6))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {9186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:39:30,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {9186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:39:30,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {9190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9052#false} is VALID [2022-04-08 10:39:30,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {9052#false} assume !false; {9052#false} is VALID [2022-04-08 10:39:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:39:30,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:40:36,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {9052#false} assume !false; {9052#false} is VALID [2022-04-08 10:40:36,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {9190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9052#false} is VALID [2022-04-08 10:40:36,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {9186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:40:36,793 INFO L272 TraceCheckUtils]: 34: Hoare triple {9206#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {9186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:40:36,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {9210#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {9206#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:40:36,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {9214#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {9210#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:40:36,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {9218#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9214#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:36,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {9222#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9218#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:36,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {9226#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9222#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-08 10:40:36,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {9230#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9226#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:40:36,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {9234#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9230#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:40:36,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {9238#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9234#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:40:36,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {9242#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9238#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:40:36,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {9246#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9242#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:36,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {9250#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9246#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:36,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {9254#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9250#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:40:36,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {9258#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9254#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:40:37,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {9262#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9258#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {9266#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9262#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))))} is VALID [2022-04-08 10:40:37,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {9270#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9266#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {9274#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9270#(or (<= 0 (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:40:37,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {9278#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9274#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:40:37,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {9282#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9278#(or (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {9286#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9282#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {9290#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9286#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))))} is VALID [2022-04-08 10:40:37,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {9294#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9290#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {9298#(or (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 63) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9294#(or (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {9302#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9298#(or (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 63) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {9306#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 69) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9302#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (<= 0 (div (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {9310#(or (<= 0 (div (* (- 1) (mod (+ 72 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 72 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 72 main_~k~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296)) (= (mod (+ 72 main_~i~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9306#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 69) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296))))} is VALID [2022-04-08 10:40:37,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {9314#(or (and (not (= (mod (mod (mod (+ main_~i~0 75) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~i~0 75) 4294967296)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~k~0 75) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 75) 4294967296)) 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9310#(or (<= 0 (div (* (- 1) (mod (+ 72 main_~i~0) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ 72 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 72 main_~k~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296)) (= (mod (+ 72 main_~i~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:40:37,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {9314#(or (and (not (= (mod (mod (mod (+ main_~i~0 75) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~i~0 75) 4294967296)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~k~0 75) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 75) 4294967296)) 4294967296)))} is VALID [2022-04-08 10:40:37,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:40:37,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:40:37,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {9051#true} #55#return; {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:40:37,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:40:37,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {9051#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; {9318#(not (= (mod (mod 75 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:40:37,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {9051#true} call ULTIMATE.init(); {9051#true} is VALID [2022-04-08 10:40:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:40:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:40:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798790694] [2022-04-08 10:40:37,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:40:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964899941] [2022-04-08 10:40:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964899941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:40:37,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:40:37,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 61 [2022-04-08 10:40:37,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:40:37,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890074102] [2022-04-08 10:40:37,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890074102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:40:37,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:40:37,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 10:40:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654189510] [2022-04-08 10:40:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:40:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-08 10:40:37,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:40:37,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:37,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:40:37,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 10:40:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:40:37,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 10:40:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:40:37,379 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:40:58,207 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 10:40:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:40:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-08 10:40:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:40:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-08 10:40:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-08 10:40:58,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-08 10:40:58,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:40:58,436 INFO L225 Difference]: With dead ends: 46 [2022-04-08 10:40:58,436 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 10:40:58,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=943, Invalid=2963, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 10:40:58,437 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:40:58,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-04-08 10:40:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 10:40:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 10:40:58,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:40:58,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,461 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,461 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:40:58,462 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 10:40:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 10:40:58,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:40:58,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:40:58,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-08 10:40:58,463 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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-08 10:40:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:40:58,464 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 10:40:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 10:40:58,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:40:58,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:40:58,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:40:58,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:40:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-08 10:40:58,467 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-08 10:40:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:40:58,467 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-08 10:40:58,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:40:58,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-08 10:40:58,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:40:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 10:40:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:40:58,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:40:58,741 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:40:58,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-08 10:40:58,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 10:40:58,941 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:40:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:40:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 316731194, now seen corresponding path program 51 times [2022-04-08 10:40:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:40:58,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950890108] [2022-04-08 10:40:58,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:40:58,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:40:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 316731194, now seen corresponding path program 52 times [2022-04-08 10:40:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:40:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110489100] [2022-04-08 10:40:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:40:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:40:58,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:40:58,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579681494] [2022-04-08 10:40:58,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:40:58,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:40:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:40:58,964 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:40:58,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 10:40:59,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:40:59,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:40:59,077 WARN L261 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 170 conjunts are in the unsatisfiable core [2022-04-08 10:40:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:40:59,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:41:00,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {9595#true} call ULTIMATE.init(); {9595#true} is VALID [2022-04-08 10:41:00,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {9595#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; {9603#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:41:00,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {9603#(= ~SIZE~0 20000001)} assume true; {9603#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:41:00,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9603#(= ~SIZE~0 20000001)} {9595#true} #55#return; {9603#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:41:00,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {9603#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {9603#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:41:00,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {9603#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {9603#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:41:00,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {9603#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {9619#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:41:00,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {9619#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9623#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-08 10:41:00,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {9623#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9627#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:41:00,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {9627#(and (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 6)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9631#(and (= main_~i~0 main_~k~0) (= 0 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {9631#(and (= main_~i~0 main_~k~0) (= 0 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9635#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {9635#(and (= (+ main_~j~0 (- 6)) (+ main_~k~0 (- 6))) (= main_~i~0 main_~k~0) (= (+ main_~k~0 (- 12)) 0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9639#(and (= (+ (- 15) main_~i~0) 0) (= (+ (- 9) main_~i~0) (+ (- 9) main_~j~0)) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {9639#(and (= (+ (- 15) main_~i~0) 0) (= (+ (- 9) main_~i~0) (+ (- 9) main_~j~0)) (= main_~i~0 main_~k~0) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9643#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~j~0 (- 18)) 0))} is VALID [2022-04-08 10:41:00,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {9643#(and (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~j~0 (- 18)) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9647#(and (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} is VALID [2022-04-08 10:41:00,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {9647#(and (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 18) (= (+ main_~i~0 (- 3)) 18) (= main_~j~0 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9651#(and (= (+ main_~j~0 (- 3)) 21) (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 18))} is VALID [2022-04-08 10:41:00,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {9651#(and (= (+ main_~j~0 (- 3)) 21) (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9655#(and (= main_~i~0 27) (= (+ main_~j~0 (- 6)) 21) (= main_~k~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {9655#(and (= main_~i~0 27) (= (+ main_~j~0 (- 6)) 21) (= main_~k~0 27) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9659#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} is VALID [2022-04-08 10:41:00,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {9659#(and (= 30 main_~j~0) (= 30 main_~i~0) (= ~SIZE~0 20000001) (= 30 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9663#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {9663#(and (= main_~k~0 33) (= main_~j~0 33) (= (+ main_~i~0 (- 3)) 30) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9667#(and (= (+ main_~j~0 (- 3)) 33) (= (+ main_~k~0 (- 3)) 33) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} is VALID [2022-04-08 10:41:00,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {9667#(and (= (+ main_~j~0 (- 3)) 33) (= (+ main_~k~0 (- 3)) 33) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 30))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9671#(and (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 33))} is VALID [2022-04-08 10:41:00,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {9671#(and (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 33))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9675#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 39) (= 42 main_~j~0))} is VALID [2022-04-08 10:41:00,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {9675#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 39) (= 42 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9679#(and (= (+ main_~j~0 (- 3)) 42) (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~k~0 45))} is VALID [2022-04-08 10:41:00,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {9679#(and (= (+ main_~j~0 (- 3)) 42) (= main_~i~0 45) (= ~SIZE~0 20000001) (= main_~k~0 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9683#(and (= main_~i~0 48) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 42) (= main_~k~0 48))} is VALID [2022-04-08 10:41:00,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {9683#(and (= main_~i~0 48) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 42) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9687#(and (= 51 main_~k~0) (= 51 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 48))} is VALID [2022-04-08 10:41:00,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {9687#(and (= 51 main_~k~0) (= 51 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9691#(and (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001) (= 51 (+ main_~k~0 (- 3))) (= main_~i~0 54))} is VALID [2022-04-08 10:41:00,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {9691#(and (= 51 (+ main_~j~0 (- 3))) (= ~SIZE~0 20000001) (= 51 (+ main_~k~0 (- 3))) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9695#(and (= 57 main_~i~0) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= 57 main_~j~0))} is VALID [2022-04-08 10:41:00,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {9695#(and (= 57 main_~i~0) (= 57 main_~k~0) (= ~SIZE~0 20000001) (= 57 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9699#(and (= 57 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= main_~i~0 60) (= 57 (+ main_~j~0 (- 3))))} is VALID [2022-04-08 10:41:00,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {9699#(and (= 57 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (= main_~i~0 60) (= 57 (+ main_~j~0 (- 3))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9703#(and (= main_~j~0 63) (= main_~k~0 63) (= (+ main_~i~0 (- 3)) 60) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {9703#(and (= main_~j~0 63) (= main_~k~0 63) (= (+ main_~i~0 (- 3)) 60) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9707#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0))} is VALID [2022-04-08 10:41:00,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {9707#(and (= (+ main_~j~0 (- 3)) 63) (= 66 main_~i~0) (= ~SIZE~0 20000001) (= 66 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9711#(and (= (+ main_~j~0 (- 6)) 63) (= (+ main_~i~0 (- 3)) 66) (= 66 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {9711#(and (= (+ main_~j~0 (- 6)) 63) (= (+ main_~i~0 (- 3)) 66) (= 66 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9715#(and (= 72 main_~j~0) (= 66 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= (+ main_~i~0 (- 6)) 66))} is VALID [2022-04-08 10:41:00,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {9715#(and (= 72 main_~j~0) (= 66 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= (+ main_~i~0 (- 6)) 66))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9719#(and (= 72 (+ main_~j~0 (- 3))) (= 66 (+ (- 9) main_~i~0)) (= 66 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (< (mod (+ 4294967290 main_~i~0) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:41:00,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {9719#(and (= 72 (+ main_~j~0 (- 3))) (= 66 (+ (- 9) main_~i~0)) (= 66 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (< (mod (+ 4294967290 main_~i~0) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9723#(and (= (+ main_~j~0 (- 6)) 72) (= main_~i~0 78) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 12)) 66) (< 69 (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:41:00,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {9723#(and (= (+ main_~j~0 (- 6)) 72) (= main_~i~0 78) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 12)) 66) (< 69 (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {9727#(and (= (+ main_~j~0 (- 6)) 72) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~i~0 78) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 12)) 66) (< 69 (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:41:00,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {9727#(and (= (+ main_~j~0 (- 6)) 72) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= main_~i~0 78) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 12)) 66) (< 69 (mod main_~n~0 4294967296)))} assume ~n~0 % 4294967296 > 0; {9731#(and (= main_~k~0 78) (= main_~j~0 78) (= main_~i~0 78) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:41:00,556 INFO L272 TraceCheckUtils]: 35: Hoare triple {9731#(and (= main_~k~0 78) (= main_~j~0 78) (= main_~i~0 78) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {9735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:41:00,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {9735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:41:00,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {9739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9596#false} is VALID [2022-04-08 10:41:00,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {9596#false} assume !false; {9596#false} is VALID [2022-04-08 10:41:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:41:00,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:42:48,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {9596#false} assume !false; {9596#false} is VALID [2022-04-08 10:42:48,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {9739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9596#false} is VALID [2022-04-08 10:42:48,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {9735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:42:48,568 INFO L272 TraceCheckUtils]: 35: Hoare triple {9755#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {9735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:42:48,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {9759#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} assume ~n~0 % 4294967296 > 0; {9755#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-08 10:42:48,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {9763#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {9759#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:42:48,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {9767#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9763#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:42:48,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {9771#(or (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9767#(or (< (mod (+ main_~i~0 3) 4294967296) (mod main_~n~0 4294967296)) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:42:48,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {9775#(or (<= (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9771#(or (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))) (not (< 0 (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 6) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:42:48,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {9779#(or (<= (+ (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9775#(or (<= (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-08 10:42:48,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {9783#(or (<= (+ (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9779#(or (<= (+ (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-08 10:42:48,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {9787#(or (<= (+ (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 18) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9783#(or (<= (+ (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 15) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-08 10:42:48,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {9791#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9787#(or (<= (+ (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 18) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-08 10:42:48,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9791#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 21) 4294967296)) (mod (+ main_~i~0 12) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {9799#(or (<= (+ (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) (- 4294967296)) (div (+ (mod (+ main_~i~0 18) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296))) 1) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9795#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 24) 4294967296)) (mod (+ main_~i~0 15) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {9803#(or (<= (+ (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9799#(or (<= (+ (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) (- 4294967296)) (div (+ (mod (+ main_~i~0 18) 4294967296) (* (mod (+ main_~i~0 27) 4294967296) (- 1))) (- 4294967296))) 1) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-08 10:42:48,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {9807#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ main_~i~0 24) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9803#(or (<= (+ (div (+ (mod (+ main_~i~0 21) 4294967296) (* (- 1) (mod (+ 30 main_~i~0) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:42:48,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {9811#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (+ (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ main_~i~0 36) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9807#(or (and (not (= (mod (mod (mod (+ main_~i~0 33) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~k~0 33) 4294967296)) (= (mod (+ main_~j~0 33) 4294967296) (mod (+ main_~i~0 33) 4294967296))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 33) 4294967296)) (mod (+ main_~i~0 24) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {9815#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9811#(or (and (not (= (mod (mod (mod (+ main_~i~0 36) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~k~0 36) 4294967296)) (= (mod (+ main_~j~0 36) 4294967296) (mod (+ main_~i~0 36) 4294967296))) (<= (+ (div (+ (mod (+ main_~i~0 27) 4294967296) (* (- 1) (mod (+ main_~i~0 36) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {9819#(or (<= (+ (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9815#(or (and (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~i~0 39) 4294967296)) (= (mod (+ main_~j~0 39) 4294967296) (mod (+ main_~k~0 39) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 39) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 39) 4294967296)) (mod (+ 30 main_~i~0) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {9823#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9819#(or (<= (+ (div (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ 42 main_~i~0) 4294967296)) (mod (+ main_~i~0 33) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ 42 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~i~0) 4294967296)) (= (mod (+ 42 main_~j~0) 4294967296) (mod (+ 42 main_~k~0) 4294967296))))} is VALID [2022-04-08 10:42:48,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {9827#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (mod (+ main_~i~0 39) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9823#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (mod (+ main_~i~0 36) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 45) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296)) (= (mod (+ main_~k~0 45) 4294967296) (mod (+ main_~j~0 45) 4294967296))))} is VALID [2022-04-08 10:42:48,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {9831#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9827#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 48) 4294967296)) (mod (+ main_~i~0 39) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~k~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (= (mod (+ main_~i~0 48) 4294967296) (mod (+ main_~j~0 48) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 48) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} is VALID [2022-04-08 10:42:48,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {9835#(or (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 54) 4294967296)) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9831#(or (and (= (mod (+ 51 main_~i~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 51 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 51 main_~k~0) 4294967296) (mod (+ 51 main_~j~0) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (mod (+ 42 main_~i~0) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ 51 main_~i~0) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {9839#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (+ (mod (+ main_~i~0 48) 4294967296) (* (- 1) (mod (+ 57 main_~i~0) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9835#(or (and (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~k~0 54) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 54) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 54) 4294967296) (mod (+ main_~i~0 54) 4294967296))) (<= (+ (div (* (- 1) (mod (+ main_~i~0 54) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 54) 4294967296)) (mod (+ main_~i~0 45) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {9843#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 60) 4294967296)) (mod (+ 51 main_~i~0) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9839#(or (and (= (mod (+ 57 main_~i~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (= (mod (+ 57 main_~k~0) 4294967296) (mod (+ 57 main_~j~0) 4294967296)) (not (= (mod (mod (mod (+ 57 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= (+ (div (+ (mod (+ main_~i~0 48) 4294967296) (* (- 1) (mod (+ 57 main_~i~0) 4294967296))) (- 4294967296)) (div (* (- 1) (mod (+ 57 main_~i~0) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {9847#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 63) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 63) 4294967296)) (mod (+ main_~i~0 54) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9843#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 60) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 60) 4294967296)) (mod (+ 51 main_~i~0) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~k~0 60) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 60) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 60) 4294967296) (mod (+ main_~i~0 60) 4294967296))))} is VALID [2022-04-08 10:42:48,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {9851#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) (mod (+ 57 main_~i~0) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9847#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 63) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 63) 4294967296)) (mod (+ main_~i~0 54) 4294967296)) (- 4294967296))) 1) (and (= (mod (+ main_~i~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (= (mod (+ main_~k~0 63) 4294967296) (mod (+ main_~j~0 63) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 63) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))))} is VALID [2022-04-08 10:42:48,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {9855#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 69) 4294967296)) (mod (+ main_~i~0 60) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 69) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9851#(or (and (not (= (mod (mod (mod (+ 66 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~k~0) 4294967296)) (= (mod (+ 66 main_~j~0) 4294967296) (mod (+ 66 main_~i~0) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) (mod (+ 57 main_~i~0) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ 66 main_~i~0) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {9859#(or (<= (+ (div (* (- 1) (mod (+ 72 main_~i~0) 4294967296)) (- 4294967296)) (div (+ (mod (+ main_~i~0 63) 4294967296) (* (- 1) (mod (+ 72 main_~i~0) 4294967296))) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ 72 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 72 main_~k~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296)) (= (mod (+ 72 main_~i~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9855#(or (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 69) 4294967296)) (mod (+ main_~i~0 60) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 69) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 69) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296)) (= (mod (+ main_~k~0 69) 4294967296) (mod (+ main_~j~0 69) 4294967296))))} is VALID [2022-04-08 10:42:48,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {9863#(or (and (not (= (mod (mod (mod (+ main_~i~0 75) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~i~0 75) 4294967296)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~k~0 75) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 75) 4294967296)) (mod (+ 66 main_~i~0) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 75) 4294967296)) (- 4294967296))) 1))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9859#(or (<= (+ (div (* (- 1) (mod (+ 72 main_~i~0) 4294967296)) (- 4294967296)) (div (+ (mod (+ main_~i~0 63) 4294967296) (* (- 1) (mod (+ 72 main_~i~0) 4294967296))) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ 72 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ 72 main_~k~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296)) (= (mod (+ 72 main_~i~0) 4294967296) (mod (+ 72 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:42:48,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {9867#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 78) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 78) 4294967296)) (mod (+ main_~i~0 69) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 78) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 78) 4294967296) (mod (+ main_~k~0 78) 4294967296)) (= (mod (+ main_~i~0 78) 4294967296) (mod (+ main_~j~0 78) 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {9863#(or (and (not (= (mod (mod (mod (+ main_~i~0 75) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~i~0 75) 4294967296)) (= (mod (+ main_~j~0 75) 4294967296) (mod (+ main_~k~0 75) 4294967296))) (<= (+ (div (+ (* (- 1) (mod (+ main_~i~0 75) 4294967296)) (mod (+ 66 main_~i~0) 4294967296)) (- 4294967296)) (div (* (- 1) (mod (+ main_~i~0 75) 4294967296)) (- 4294967296))) 1))} is VALID [2022-04-08 10:42:48,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {9867#(or (<= (+ (div (* (- 1) (mod (+ main_~i~0 78) 4294967296)) (- 4294967296)) (div (+ (* (- 1) (mod (+ main_~i~0 78) 4294967296)) (mod (+ main_~i~0 69) 4294967296)) (- 4294967296))) 1) (and (not (= (mod (mod (mod (+ main_~i~0 78) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 78) 4294967296) (mod (+ main_~k~0 78) 4294967296)) (= (mod (+ main_~i~0 78) 4294967296) (mod (+ main_~j~0 78) 4294967296))))} is VALID [2022-04-08 10:42:48,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:42:48,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} call #t~ret5 := main(); {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:42:48,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {9595#true} #55#return; {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:42:48,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} assume true; {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:42:48,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {9595#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; {9871#(not (= (mod (mod 78 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-08 10:42:48,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {9595#true} call ULTIMATE.init(); {9595#true} is VALID [2022-04-08 10:42:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 350 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:42:49,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:42:49,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110489100] [2022-04-08 10:42:49,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:42:49,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579681494] [2022-04-08 10:42:49,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579681494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:42:49,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:42:49,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 64 [2022-04-08 10:42:49,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:42:49,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950890108] [2022-04-08 10:42:49,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950890108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:49,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:49,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 10:42:49,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711799422] [2022-04-08 10:42:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:42:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 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 39 [2022-04-08 10:42:49,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:42:49,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:42:49,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:49,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 10:42:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 10:42:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=3002, Unknown=1, NotChecked=0, Total=4032 [2022-04-08 10:42:49,195 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:13,529 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 10:43:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:43:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 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 39 [2022-04-08 10:43:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-08 10:43:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-08 10:43:13,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-08 10:43:13,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:13,775 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:43:13,775 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 10:43:13,775 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 106.4s TimeCoverageRelationStatistics Valid=1041, Invalid=3248, Unknown=1, NotChecked=0, Total=4290 [2022-04-08 10:43:13,776 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:43:13,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-04-08 10:43:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 10:43:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 10:43:13,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:13,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,800 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,800 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:13,801 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 10:43:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 10:43:13,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:13,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:13,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 41 states. [2022-04-08 10:43:13,802 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 41 states. [2022-04-08 10:43:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:13,802 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 10:43:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 10:43:13,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:13,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:13,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:13,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-08 10:43:13,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-08 10:43:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:13,804 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-08 10:43:13,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:43:13,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-08 10:43:14,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 10:43:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:43:14,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:14,143 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:43:14,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 10:43:14,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:43:14,344 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1541176901, now seen corresponding path program 53 times [2022-04-08 10:43:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:14,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78266740] [2022-04-08 10:43:14,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:43:14,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:43:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1541176901, now seen corresponding path program 54 times [2022-04-08 10:43:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:14,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101611381] [2022-04-08 10:43:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:14,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:14,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887717237] [2022-04-08 10:43:14,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:43:14,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:14,367 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:14,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 10:43:20,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-08 10:43:20,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:20,851 WARN L261 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 179 conjunts are in the unsatisfiable core [2022-04-08 10:43:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:20,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:23,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {10154#true} call ULTIMATE.init(); {10154#true} is VALID [2022-04-08 10:43:23,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {10154#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; {10162#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:43:23,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {10162#(= ~SIZE~0 20000001)} assume true; {10162#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:43:23,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10162#(= ~SIZE~0 20000001)} {10154#true} #55#return; {10162#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:43:23,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {10162#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {10162#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:43:23,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {10162#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {10162#(= ~SIZE~0 20000001)} is VALID [2022-04-08 10:43:23,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {10162#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {10178#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:43:23,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {10178#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10182#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:43:23,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {10182#(and (= (+ main_~j~0 (- 3)) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10186#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {10186#(and (= main_~i~0 main_~j~0) (= (+ main_~j~0 (- 3)) (+ main_~k~0 (- 3))) (= (+ main_~j~0 (- 6)) 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10190#(and (= (+ (- 9) main_~j~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 10:43:23,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {10190#(and (= (+ (- 9) main_~j~0) 0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10194#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {10194#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10198#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~j~0 15) (= main_~k~0 15))} is VALID [2022-04-08 10:43:23,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {10198#(and (= main_~i~0 15) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~j~0 15) (= main_~k~0 15))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10202#(and (= (+ main_~i~0 (- 3)) 15) (= (+ main_~j~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {10202#(and (= (+ main_~i~0 (- 3)) 15) (= (+ main_~j~0 (- 3)) 15) (= main_~k~0 18) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10206#(and (= main_~i~0 21) (= (+ main_~j~0 (- 6)) 15) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 3)) 18))} is VALID [2022-04-08 10:43:23,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {10206#(and (= main_~i~0 21) (= (+ main_~j~0 (- 6)) 15) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 3)) 18))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10210#(and (= 15 (+ (- 9) main_~j~0)) (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) 21))} is VALID [2022-04-08 10:43:23,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {10210#(and (= 15 (+ (- 9) main_~j~0)) (= 18 (+ main_~k~0 (- 6))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) 21))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10214#(and (= main_~j~0 27) (= main_~i~0 27) (= 18 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {10214#(and (= main_~j~0 27) (= main_~i~0 27) (= 18 (+ (- 9) main_~k~0)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10218#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~j~0 (- 3)) 27) (= (+ main_~k~0 (- 12)) 18) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {10218#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~j~0 (- 3)) 27) (= (+ main_~k~0 (- 12)) 18) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10222#(and (= main_~k~0 33) (= (+ main_~i~0 (- 6)) 27) (= main_~j~0 33) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {10222#(and (= main_~k~0 33) (= (+ main_~i~0 (- 6)) 27) (= main_~j~0 33) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10226#(and (= (+ main_~k~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 36))} is VALID [2022-04-08 10:43:23,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {10226#(and (= (+ main_~k~0 (- 3)) 33) (= main_~j~0 36) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 36))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10230#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {10230#(and (= main_~j~0 39) (= main_~k~0 39) (= main_~i~0 39) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10234#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} is VALID [2022-04-08 10:43:23,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {10234#(and (= 39 (+ main_~k~0 (- 3))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) 39) (= (+ main_~j~0 (- 3)) 39))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10238#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~j~0 (- 6)) 39) (= main_~k~0 45))} is VALID [2022-04-08 10:43:23,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {10238#(and (= main_~i~0 45) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~j~0 (- 6)) 39) (= main_~k~0 45))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10242#(and (= (+ main_~i~0 (- 3)) 45) (= 39 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 48))} is VALID [2022-04-08 10:43:23,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {10242#(and (= (+ main_~i~0 (- 3)) 45) (= 39 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 48))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10246#(and (= (+ main_~k~0 (- 3)) 48) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {10246#(and (= (+ main_~k~0 (- 3)) 48) (= 51 main_~j~0) (= 51 main_~i~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10250#(and (= main_~k~0 54) (= main_~j~0 54) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 54))} is VALID [2022-04-08 10:43:23,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {10250#(and (= main_~k~0 54) (= main_~j~0 54) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 54))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10254#(and (= 57 main_~i~0) (= 57 main_~k~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 57 main_~j~0))} is VALID [2022-04-08 10:43:23,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {10254#(and (= 57 main_~i~0) (= 57 main_~k~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 57 main_~j~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10258#(and (= (+ main_~i~0 (- 3)) 57) (= 57 (+ main_~k~0 (- 3))) (= main_~j~0 60) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {10258#(and (= (+ main_~i~0 (- 3)) 57) (= 57 (+ main_~k~0 (- 3))) (= main_~j~0 60) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10262#(and (= 57 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 60) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 6)) 57))} is VALID [2022-04-08 10:43:23,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {10262#(and (= 57 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 60) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 6)) 57))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10266#(and (= 66 main_~i~0) (= 66 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 57 (+ (- 9) main_~k~0)))} is VALID [2022-04-08 10:43:23,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {10266#(and (= 66 main_~i~0) (= 66 main_~j~0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 57 (+ (- 9) main_~k~0)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10270#(and (= main_~i~0 69) (< 66 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 12)) 57) (= main_~j~0 69))} is VALID [2022-04-08 10:43:23,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {10270#(and (= main_~i~0 69) (< 66 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~k~0 (- 12)) 57) (= main_~j~0 69))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10274#(and (= 72 main_~i~0) (= (+ main_~j~0 (- 3)) 69) (< 66 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 72 main_~k~0))} is VALID [2022-04-08 10:43:23,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {10274#(and (= 72 main_~i~0) (= (+ main_~j~0 (- 3)) 69) (< 66 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 72 main_~k~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10278#(and (= (+ main_~j~0 (- 6)) 69) (= main_~k~0 75) (< 66 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) 72))} is VALID [2022-04-08 10:43:23,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {10278#(and (= (+ main_~j~0 (- 6)) 69) (= main_~k~0 75) (< 66 (mod main_~n~0 4294967296)) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ main_~i~0 (- 3)) 72))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10282#(and (< 66 (mod main_~n~0 4294967296)) (= main_~i~0 78) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 69 (+ (- 9) main_~j~0)) (= (+ main_~k~0 (- 3)) 75))} is VALID [2022-04-08 10:43:23,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {10282#(and (< 66 (mod main_~n~0 4294967296)) (= main_~i~0 78) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= 69 (+ (- 9) main_~j~0)) (= (+ main_~k~0 (- 3)) 75))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0;~j~0 := 3 + ~j~0;~k~0 := 3 + ~k~0; {10286#(and (= (+ main_~k~0 (- 6)) 75) (= (+ main_~i~0 (- 3)) 78) (< 66 (mod main_~n~0 4294967296)) (= (+ main_~j~0 (- 12)) 69) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-08 10:43:23,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {10286#(and (= (+ main_~k~0 (- 6)) 75) (= (+ main_~i~0 (- 3)) 78) (< 66 (mod main_~n~0 4294967296)) (= (+ main_~j~0 (- 12)) 69) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {10290#(and (= 81 main_~i~0) (= 81 main_~j~0) (= 81 main_~k~0) (< 66 (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:43:23,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {10290#(and (= 81 main_~i~0) (= 81 main_~j~0) (= 81 main_~k~0) (< 66 (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod main_~i~0 4294967296)) (= ~SIZE~0 20000001))} assume ~n~0 % 4294967296 > 0; {10294#(and (= 81 main_~i~0) (= 81 main_~j~0) (= 81 main_~k~0) (= ~SIZE~0 20000001))} is VALID [2022-04-08 10:43:23,420 INFO L272 TraceCheckUtils]: 36: Hoare triple {10294#(and (= 81 main_~i~0) (= 81 main_~j~0) (= 81 main_~k~0) (= ~SIZE~0 20000001))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {10298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:23,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {10298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:23,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {10302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10155#false} is VALID [2022-04-08 10:43:23,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {10155#false} assume !false; {10155#false} is VALID [2022-04-08 10:43:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:43:23,422 INFO L328 TraceCheckSpWp]: Computing backward predicates...