/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:18:26,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:18:26,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:18:26,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:18:26,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:18:26,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:18:26,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:18:26,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:18:26,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:18:26,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:18:26,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:18:26,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:18:26,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:18:26,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:18:26,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:18:26,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:18:26,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:18:26,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:18:26,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:18:26,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:18:26,898 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:18:26,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:18:26,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:18:26,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:18:26,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:18:26,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:18:26,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:18:26,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:18:26,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:18:26,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:18:26,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:18:26,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:18:26,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:18:26,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:18:26,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:18:26,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:18:26,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:18:26,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:18:26,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:18:26,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:18:26,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:18:26,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:18:26,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:18:26,941 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:18:26,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:18:26,942 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:18:26,942 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:18:26,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:18:26,942 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:18:26,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:18:26,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:18:26,943 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:18:26,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:18:26,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:18:26,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:18:26,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:18:26,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:18:26,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:18:26,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:18:26,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:18:26,946 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:18:26,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:18:26,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:18:26,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-07 12:18:27,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:18:27,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:18:27,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:18:27,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:18:27,174 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:18:27,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-07 12:18:27,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4aeb17b0/cbbc817bdda34739b57b766803de0713/FLAG74fae1662 [2022-04-07 12:18:27,597 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:18:27,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-07 12:18:27,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4aeb17b0/cbbc817bdda34739b57b766803de0713/FLAG74fae1662 [2022-04-07 12:18:27,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4aeb17b0/cbbc817bdda34739b57b766803de0713 [2022-04-07 12:18:27,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:18:27,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:18:27,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:18:27,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:18:27,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:18:27,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32634a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27, skipping insertion in model container [2022-04-07 12:18:27,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:18:27,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:18:27,782 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/sumt8.c[403,416] [2022-04-07 12:18:27,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:18:27,804 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:18:27,814 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/sumt8.c[403,416] [2022-04-07 12:18:27,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:18:27,833 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:18:27,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27 WrapperNode [2022-04-07 12:18:27,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:18:27,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:18:27,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:18:27,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:18:27,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:18:27,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:18:27,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:18:27,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:18:27,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (1/1) ... [2022-04-07 12:18:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:18:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:18:27,912 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-07 12:18:27,926 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-07 12:18:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:18:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:18:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:18:27,949 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:18:27,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:18:27,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:18:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:18:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:18:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:18:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:18:27,994 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:18:27,995 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:18:36,817 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:18:36,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:18:36,822 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:18:36,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:18:36 BoogieIcfgContainer [2022-04-07 12:18:36,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:18:36,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:18:36,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:18:36,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:18:36,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:18:27" (1/3) ... [2022-04-07 12:18:36,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bf158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:18:36, skipping insertion in model container [2022-04-07 12:18:36,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:18:27" (2/3) ... [2022-04-07 12:18:36,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bf158e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:18:36, skipping insertion in model container [2022-04-07 12:18:36,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:18:36" (3/3) ... [2022-04-07 12:18:36,835 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt8.c [2022-04-07 12:18:36,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:18:36,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:18:36,866 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:18:36,870 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-07 12:18:36,870 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:18:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 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-07 12:18:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 12:18:36,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:18:36,892 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:18:36,893 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:18:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:18:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 1 times [2022-04-07 12:18:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:18:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996661576] [2022-04-07 12:18:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:18:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:18:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:18:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:18:37,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {31#true} is VALID [2022-04-07 12:18:37,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-07 12:18:37,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-07 12:18:37,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:18:37,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {31#true} is VALID [2022-04-07 12:18:37,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-07 12:18:37,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-07 12:18:37,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-07 12:18:37,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:37,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:37,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:37,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {37#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} is VALID [2022-04-07 12:18:37,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} ~l~0 := 1 + ~l~0; {38#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:18:37,494 INFO L272 TraceCheckUtils]: 10: Hoare triple {38#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:18:37,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:18:37,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32#false} is VALID [2022-04-07 12:18:37,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-07 12:18:37,495 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-07 12:18:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:18:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996661576] [2022-04-07 12:18:37,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996661576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:18:37,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:18:37,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 12:18:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748511838] [2022-04-07 12:18:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:18:37,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:18:37,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:18:37,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:37,533 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-07 12:18:37,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:18:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:18:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:18:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:18:37,554 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 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 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:18:40,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:44,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:48,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:55,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:57,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:59,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:01,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:06,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:10,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:12,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:15,107 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-07 12:19:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:19:15,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 12:19:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:19:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-07 12:19:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-07 12:19:15,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-07 12:19:15,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:15,232 INFO L225 Difference]: With dead ends: 66 [2022-04-07 12:19:15,232 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 12:19:15,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:19:15,236 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:19:15,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 21.3s Time] [2022-04-07 12:19:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 12:19:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-07 12:19:15,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:19:15,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:15,264 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:15,265 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:15,270 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 12:19:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 12:19:15,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:15,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:15,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-07 12:19:15,273 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-07 12:19:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:15,276 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 12:19:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 12:19:15,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:15,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:15,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:19:15,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:19:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-07 12:19:15,283 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2022-04-07 12:19:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:19:15,284 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-07 12:19:15,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:19:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-07 12:19:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:19:15,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:19:15,285 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:19:15,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:19:15,285 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:19:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:19:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1294727378, now seen corresponding path program 1 times [2022-04-07 12:19:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:19:15,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911674453] [2022-04-07 12:19:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:19:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:15,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:19:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:15,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {245#true} is VALID [2022-04-07 12:19:15,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:15,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {245#true} {245#true} #86#return; {245#true} is VALID [2022-04-07 12:19:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:19:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:15,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#true} ~cond := #in~cond; {245#true} is VALID [2022-04-07 12:19:15,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} assume !(0 == ~cond); {245#true} is VALID [2022-04-07 12:19:15,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:15,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #84#return; {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:15,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} call ULTIMATE.init(); {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:19:15,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {245#true} is VALID [2022-04-07 12:19:15,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:15,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} #86#return; {245#true} is VALID [2022-04-07 12:19:15,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} call #t~ret5 := main(); {245#true} is VALID [2022-04-07 12:19:15,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {250#(= main_~l~0 0)} is VALID [2022-04-07 12:19:15,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {250#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {250#(= main_~l~0 0)} is VALID [2022-04-07 12:19:15,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {250#(= main_~l~0 0)} is VALID [2022-04-07 12:19:15,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {250#(= main_~l~0 0)} is VALID [2022-04-07 12:19:15,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:15,419 INFO L272 TraceCheckUtils]: 10: Hoare triple {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {245#true} is VALID [2022-04-07 12:19:15,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#true} ~cond := #in~cond; {245#true} is VALID [2022-04-07 12:19:15,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#true} assume !(0 == ~cond); {245#true} is VALID [2022-04-07 12:19:15,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:15,420 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {245#true} {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #84#return; {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:15,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:15,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {251#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {246#false} is VALID [2022-04-07 12:19:15,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {246#false} ~l~0 := 1 + ~l~0; {246#false} is VALID [2022-04-07 12:19:15,421 INFO L272 TraceCheckUtils]: 18: Hoare triple {246#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {246#false} is VALID [2022-04-07 12:19:15,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {246#false} ~cond := #in~cond; {246#false} is VALID [2022-04-07 12:19:15,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {246#false} assume 0 == ~cond; {246#false} is VALID [2022-04-07 12:19:15,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {246#false} assume !false; {246#false} is VALID [2022-04-07 12:19:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:15,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:19:15,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911674453] [2022-04-07 12:19:15,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911674453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:15,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69461702] [2022-04-07 12:19:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:19:15,425 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-07 12:19:15,426 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-07 12:19:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:15,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:19:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:15,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:19:16,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} call ULTIMATE.init(); {245#true} is VALID [2022-04-07 12:19:16,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#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; {245#true} is VALID [2022-04-07 12:19:16,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:16,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} #86#return; {245#true} is VALID [2022-04-07 12:19:16,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} call #t~ret5 := main(); {245#true} is VALID [2022-04-07 12:19:16,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {275#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {275#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {275#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {285#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,217 INFO L272 TraceCheckUtils]: 10: Hoare triple {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {245#true} is VALID [2022-04-07 12:19:16,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#true} ~cond := #in~cond; {245#true} is VALID [2022-04-07 12:19:16,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#true} assume !(0 == ~cond); {245#true} is VALID [2022-04-07 12:19:16,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:16,218 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {245#true} {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {289#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {311#(and (= (+ (- 1) main_~v5~0) 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {311#(and (= (+ (- 1) main_~v5~0) 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {315#(and (= (+ (- 1) main_~v5~0) 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:19:16,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {315#(and (= (+ (- 1) main_~v5~0) 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:19:16,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:19:16,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {246#false} is VALID [2022-04-07 12:19:16,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {246#false} assume !false; {246#false} is VALID [2022-04-07 12:19:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:16,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:19:16,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {246#false} assume !false; {246#false} is VALID [2022-04-07 12:19:16,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {246#false} is VALID [2022-04-07 12:19:16,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:19:16,553 INFO L272 TraceCheckUtils]: 18: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:19:16,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {343#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {343#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:19:16,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,571 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {245#true} {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:16,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#true} assume !(0 == ~cond); {245#true} is VALID [2022-04-07 12:19:16,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#true} ~cond := #in~cond; {245#true} is VALID [2022-04-07 12:19:16,572 INFO L272 TraceCheckUtils]: 10: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {245#true} is VALID [2022-04-07 12:19:16,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {343#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:19:16,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {339#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:19:16,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} call #t~ret5 := main(); {245#true} is VALID [2022-04-07 12:19:16,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} #86#return; {245#true} is VALID [2022-04-07 12:19:16,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} assume true; {245#true} is VALID [2022-04-07 12:19:16,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#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; {245#true} is VALID [2022-04-07 12:19:16,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} call ULTIMATE.init(); {245#true} is VALID [2022-04-07 12:19:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:19:16,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69461702] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:16,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:19:16,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:19:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050844881] [2022-04-07 12:19:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:19:16,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-07 12:19:16,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:19:16,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:19:16,797 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-07 12:19:16,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:19:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:19:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:19:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:19:16,799 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:19:19,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:21,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:29,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:32,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:42,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:45,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:53,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:56,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:58,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:58,980 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-07 12:19:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:19:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-07 12:19:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:19:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:19:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-07 12:19:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:19:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-07 12:19:59,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-07 12:19:59,168 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-07 12:19:59,169 INFO L225 Difference]: With dead ends: 42 [2022-04-07 12:19:59,169 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 12:19:59,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:19:59,170 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:19:59,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 9 Unknown, 0 Unchecked, 20.0s Time] [2022-04-07 12:19:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 12:19:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-04-07 12:19:59,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:19:59,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:59,182 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:59,182 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:59,183 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-07 12:19:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-07 12:19:59,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:59,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:59,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-07 12:19:59,184 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-07 12:19:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:59,186 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-07 12:19:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-07 12:19:59,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:59,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:59,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:19:59,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:19:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:19:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-07 12:19:59,189 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2022-04-07 12:19:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:19:59,189 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-07 12:19:59,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:19:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-07 12:19:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 12:19:59,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:19:59,190 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:19:59,209 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-07 12:19:59,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:59,391 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:19:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:19:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1889278409, now seen corresponding path program 1 times [2022-04-07 12:19:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:19:59,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766562000] [2022-04-07 12:19:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:19:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:19:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {589#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {578#true} is VALID [2022-04-07 12:19:59,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:19:59,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {578#true} {578#true} #86#return; {578#true} is VALID [2022-04-07 12:19:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:19:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {578#true} ~cond := #in~cond; {578#true} is VALID [2022-04-07 12:19:59,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume !(0 == ~cond); {578#true} is VALID [2022-04-07 12:19:59,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:19:59,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #84#return; {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {589#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:19:59,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {578#true} is VALID [2022-04-07 12:19:59,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:19:59,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #86#return; {578#true} is VALID [2022-04-07 12:19:59,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret5 := main(); {578#true} is VALID [2022-04-07 12:19:59,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {583#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {583#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {583#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {583#(= main_~l~0 0)} is VALID [2022-04-07 12:19:59,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,568 INFO L272 TraceCheckUtils]: 10: Hoare triple {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {578#true} is VALID [2022-04-07 12:19:59,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#true} ~cond := #in~cond; {578#true} is VALID [2022-04-07 12:19:59,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#true} assume !(0 == ~cond); {578#true} is VALID [2022-04-07 12:19:59,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:19:59,569 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {578#true} {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #84#return; {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:19:59,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {584#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {579#false} is VALID [2022-04-07 12:19:59,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {579#false} ~l~0 := 1 + ~l~0; {579#false} is VALID [2022-04-07 12:19:59,574 INFO L272 TraceCheckUtils]: 19: Hoare triple {579#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {579#false} is VALID [2022-04-07 12:19:59,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2022-04-07 12:19:59,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {579#false} assume 0 == ~cond; {579#false} is VALID [2022-04-07 12:19:59,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-07 12:19:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:19:59,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:19:59,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766562000] [2022-04-07 12:19:59,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766562000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:59,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780404511] [2022-04-07 12:19:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:19:59,592 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-07 12:19:59,592 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-07 12:19:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:19:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:59,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:20:00,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-07 12:20:00,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#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; {578#true} is VALID [2022-04-07 12:20:00,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:20:00,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #86#return; {578#true} is VALID [2022-04-07 12:20:00,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret5 := main(); {578#true} is VALID [2022-04-07 12:20:00,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {608#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {608#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {608#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {608#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {618#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,207 INFO L272 TraceCheckUtils]: 10: Hoare triple {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {578#true} is VALID [2022-04-07 12:20:00,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#true} ~cond := #in~cond; {578#true} is VALID [2022-04-07 12:20:00,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#true} assume !(0 == ~cond); {578#true} is VALID [2022-04-07 12:20:00,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:20:00,210 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {578#true} {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {647#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {647#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {651#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:00,213 INFO L272 TraceCheckUtils]: 19: Hoare triple {651#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:00,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:00,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {579#false} is VALID [2022-04-07 12:20:00,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-07 12:20:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:00,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:20:00,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-07 12:20:00,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {579#false} is VALID [2022-04-07 12:20:00,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:00,515 INFO L272 TraceCheckUtils]: 19: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:00,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {679#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,628 WARN L290 TraceCheckUtils]: 17: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {679#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:20:02,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,630 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {578#true} {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:20:02,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#true} assume !(0 == ~cond); {578#true} is VALID [2022-04-07 12:20:02,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#true} ~cond := #in~cond; {578#true} is VALID [2022-04-07 12:20:02,630 INFO L272 TraceCheckUtils]: 10: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {578#true} is VALID [2022-04-07 12:20:02,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {679#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:20:02,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {675#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:02,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret5 := main(); {578#true} is VALID [2022-04-07 12:20:02,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #86#return; {578#true} is VALID [2022-04-07 12:20:02,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-07 12:20:02,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#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; {578#true} is VALID [2022-04-07 12:20:02,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-07 12:20:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:20:02,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780404511] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:02,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:20:02,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:20:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377932493] [2022-04-07 12:20:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:20:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-07 12:20:02,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:02,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:04,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:04,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:20:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:04,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:20:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:20:04,792 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:06,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:09,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:13,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:19,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:24,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:30,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:35,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:41,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:41,915 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-07 12:20:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:20:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-07 12:20:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:20:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-07 12:20:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-07 12:20:41,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-07 12:20:44,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:44,068 INFO L225 Difference]: With dead ends: 44 [2022-04-07 12:20:44,068 INFO L226 Difference]: Without dead ends: 42 [2022-04-07 12:20:44,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:20:44,069 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:20:44,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 16.6s Time] [2022-04-07 12:20:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-07 12:20:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-04-07 12:20:44,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:20:44,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:20:44,081 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:20:44,081 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:20:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:44,083 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-07 12:20:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-07 12:20:44,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:44,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:44,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-04-07 12:20:44,092 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 42 states. [2022-04-07 12:20:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:20:44,093 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-07 12:20:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-07 12:20:44,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:20:44,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:20:44,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:20:44,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:20:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 12:20:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-07 12:20:44,094 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-07 12:20:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:20:44,095 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-07 12:20:44,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 12:20:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 12:20:44,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:20:44,095 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:20:44,115 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-07 12:20:44,298 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,SelfDestructingSolverStorable2 [2022-04-07 12:20:44,298 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:20:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:20:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1666064243, now seen corresponding path program 1 times [2022-04-07 12:20:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:20:44,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989556898] [2022-04-07 12:20:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:44,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:20:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:20:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:44,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {936#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {925#true} is VALID [2022-04-07 12:20:44,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:44,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #86#return; {925#true} is VALID [2022-04-07 12:20:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:20:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:44,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {925#true} ~cond := #in~cond; {925#true} is VALID [2022-04-07 12:20:44,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} assume !(0 == ~cond); {925#true} is VALID [2022-04-07 12:20:44,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:44,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} #84#return; {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:44,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {936#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:20:44,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {936#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {925#true} is VALID [2022-04-07 12:20:44,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:44,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #86#return; {925#true} is VALID [2022-04-07 12:20:44,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2022-04-07 12:20:44,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {930#(= main_~l~0 0)} is VALID [2022-04-07 12:20:44,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {930#(= main_~l~0 0)} is VALID [2022-04-07 12:20:44,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {930#(= main_~l~0 0)} is VALID [2022-04-07 12:20:44,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {930#(= main_~l~0 0)} is VALID [2022-04-07 12:20:44,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:44,416 INFO L272 TraceCheckUtils]: 10: Hoare triple {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {925#true} is VALID [2022-04-07 12:20:44,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#true} ~cond := #in~cond; {925#true} is VALID [2022-04-07 12:20:44,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#true} assume !(0 == ~cond); {925#true} is VALID [2022-04-07 12:20:44,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:44,417 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {925#true} {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} #84#return; {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:44,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:44,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:44,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 12:20:44,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {931#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {926#false} is VALID [2022-04-07 12:20:44,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {926#false} ~l~0 := 1 + ~l~0; {926#false} is VALID [2022-04-07 12:20:44,421 INFO L272 TraceCheckUtils]: 20: Hoare triple {926#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {926#false} is VALID [2022-04-07 12:20:44,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-04-07 12:20:44,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {926#false} assume 0 == ~cond; {926#false} is VALID [2022-04-07 12:20:44,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-07 12:20:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:20:44,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989556898] [2022-04-07 12:20:44,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989556898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:44,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102260146] [2022-04-07 12:20:44,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:20:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:20:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:20:44,427 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-07 12:20:44,431 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-07 12:20:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:44,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:20:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:20:44,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:20:44,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-07 12:20:44,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#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; {925#true} is VALID [2022-04-07 12:20:44,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:44,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #86#return; {925#true} is VALID [2022-04-07 12:20:44,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2022-04-07 12:20:44,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {955#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {955#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {955#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {955#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {965#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {965#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,986 INFO L272 TraceCheckUtils]: 10: Hoare triple {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {925#true} is VALID [2022-04-07 12:20:44,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#true} ~cond := #in~cond; {925#true} is VALID [2022-04-07 12:20:44,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#true} assume !(0 == ~cond); {925#true} is VALID [2022-04-07 12:20:44,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:44,987 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {925#true} {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {997#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {997#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1001#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:20:44,990 INFO L272 TraceCheckUtils]: 20: Hoare triple {1001#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1005#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:44,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1009#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:44,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {1009#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {926#false} is VALID [2022-04-07 12:20:44,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-07 12:20:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:20:44,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:20:45,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-07 12:20:45,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {1009#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {926#false} is VALID [2022-04-07 12:20:45,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1009#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:20:45,233 INFO L272 TraceCheckUtils]: 20: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1005#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:45,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,345 WARN L290 TraceCheckUtils]: 18: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:20:47,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,347 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {925#true} {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:47,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#true} assume !(0 == ~cond); {925#true} is VALID [2022-04-07 12:20:47,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#true} ~cond := #in~cond; {925#true} is VALID [2022-04-07 12:20:47,348 INFO L272 TraceCheckUtils]: 10: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {925#true} is VALID [2022-04-07 12:20:47,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {1029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:20:47,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1025#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:20:47,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID [2022-04-07 12:20:47,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #86#return; {925#true} is VALID [2022-04-07 12:20:47,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-07 12:20:47,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#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; {925#true} is VALID [2022-04-07 12:20:47,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-07 12:20:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:20:47,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102260146] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:20:47,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:20:47,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:20:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509602277] [2022-04-07 12:20:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:20:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-07 12:20:47,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:47,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:49,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:49,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:20:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:20:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:20:49,523 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:20:51,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:53,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:55,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:58,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:06,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:11,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:13,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:19,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:24,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:26,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:26,368 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-07 12:21:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:21:26,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-07 12:21:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:21:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:21:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 12:21:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:21:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 12:21:26,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 12:21:28,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:28,661 INFO L225 Difference]: With dead ends: 55 [2022-04-07 12:21:28,661 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 12:21:28,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:21:28,662 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-07 12:21:28,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 10 Unknown, 0 Unchecked, 20.9s Time] [2022-04-07 12:21:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 12:21:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-07 12:21:28,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:21:28,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:21:28,684 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:21:28,684 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:21:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:28,686 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-07 12:21:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-07 12:21:28,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:28,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:28,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 53 states. [2022-04-07 12:21:28,687 INFO L87 Difference]: Start difference. First operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 53 states. [2022-04-07 12:21:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:21:28,688 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-07 12:21:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-07 12:21:28,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:21:28,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:21:28,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:21:28,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:21:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:21:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-07 12:21:28,690 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 24 [2022-04-07 12:21:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:21:28,690 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-07 12:21:28,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:21:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-07 12:21:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 12:21:28,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:21:28,691 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:21:28,710 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-07 12:21:28,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:28,893 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:21:28,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:21:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1101753362, now seen corresponding path program 1 times [2022-04-07 12:21:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:21:28,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979064356] [2022-04-07 12:21:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:21:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:21:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:29,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {1350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1339#true} is VALID [2022-04-07 12:21:29,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:29,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1339#true} {1339#true} #86#return; {1339#true} is VALID [2022-04-07 12:21:29,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:21:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:29,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {1339#true} ~cond := #in~cond; {1339#true} is VALID [2022-04-07 12:21:29,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#true} assume !(0 == ~cond); {1339#true} is VALID [2022-04-07 12:21:29,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:29,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} #84#return; {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {1339#true} call ULTIMATE.init(); {1350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:21:29,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1350#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1339#true} is VALID [2022-04-07 12:21:29,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:29,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1339#true} #86#return; {1339#true} is VALID [2022-04-07 12:21:29,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {1339#true} call #t~ret5 := main(); {1339#true} is VALID [2022-04-07 12:21:29,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1344#(= main_~l~0 0)} is VALID [2022-04-07 12:21:29,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {1344#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1344#(= main_~l~0 0)} is VALID [2022-04-07 12:21:29,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {1344#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1344#(= main_~l~0 0)} is VALID [2022-04-07 12:21:29,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {1344#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1344#(= main_~l~0 0)} is VALID [2022-04-07 12:21:29,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {1344#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,028 INFO L272 TraceCheckUtils]: 10: Hoare triple {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1339#true} is VALID [2022-04-07 12:21:29,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#true} ~cond := #in~cond; {1339#true} is VALID [2022-04-07 12:21:29,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#true} assume !(0 == ~cond); {1339#true} is VALID [2022-04-07 12:21:29,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:29,029 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1339#true} {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} #84#return; {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:21:29,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1345#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1340#false} is VALID [2022-04-07 12:21:29,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1340#false} ~l~0 := 1 + ~l~0; {1340#false} is VALID [2022-04-07 12:21:29,033 INFO L272 TraceCheckUtils]: 21: Hoare triple {1340#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1340#false} is VALID [2022-04-07 12:21:29,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {1340#false} ~cond := #in~cond; {1340#false} is VALID [2022-04-07 12:21:29,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {1340#false} assume 0 == ~cond; {1340#false} is VALID [2022-04-07 12:21:29,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {1340#false} assume !false; {1340#false} is VALID [2022-04-07 12:21:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:29,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:21:29,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979064356] [2022-04-07 12:21:29,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979064356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:29,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229402684] [2022-04-07 12:21:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:21:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:21:29,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:21:29,044 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-07 12:21:29,044 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-07 12:21:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:29,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:21:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:21:29,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:21:29,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {1339#true} call ULTIMATE.init(); {1339#true} is VALID [2022-04-07 12:21:29,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#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; {1339#true} is VALID [2022-04-07 12:21:29,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:29,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1339#true} #86#return; {1339#true} is VALID [2022-04-07 12:21:29,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {1339#true} call #t~ret5 := main(); {1339#true} is VALID [2022-04-07 12:21:29,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1369#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {1369#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1369#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1369#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1369#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {1369#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1379#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,634 INFO L272 TraceCheckUtils]: 10: Hoare triple {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1339#true} is VALID [2022-04-07 12:21:29,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#true} ~cond := #in~cond; {1339#true} is VALID [2022-04-07 12:21:29,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#true} assume !(0 == ~cond); {1339#true} is VALID [2022-04-07 12:21:29,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:29,635 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1339#true} {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:21:29,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {1383#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1414#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:29,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {1414#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1418#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:21:29,639 INFO L272 TraceCheckUtils]: 21: Hoare triple {1418#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:29,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {1422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:29,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {1426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1340#false} is VALID [2022-04-07 12:21:29,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {1340#false} assume !false; {1340#false} is VALID [2022-04-07 12:21:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:21:29,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:21:29,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {1340#false} assume !false; {1340#false} is VALID [2022-04-07 12:21:29,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {1426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1340#false} is VALID [2022-04-07 12:21:29,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {1422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:21:29,862 INFO L272 TraceCheckUtils]: 21: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:21:29,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,972 WARN L290 TraceCheckUtils]: 19: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1446#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:21:31,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,975 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1339#true} {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:31,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#true} assume !(0 == ~cond); {1339#true} is VALID [2022-04-07 12:21:31,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#true} ~cond := #in~cond; {1339#true} is VALID [2022-04-07 12:21:31,975 INFO L272 TraceCheckUtils]: 10: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1339#true} is VALID [2022-04-07 12:21:31,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1446#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:21:31,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1442#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:21:31,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {1339#true} call #t~ret5 := main(); {1339#true} is VALID [2022-04-07 12:21:31,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1339#true} {1339#true} #86#return; {1339#true} is VALID [2022-04-07 12:21:31,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#true} assume true; {1339#true} is VALID [2022-04-07 12:21:31,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#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; {1339#true} is VALID [2022-04-07 12:21:31,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {1339#true} call ULTIMATE.init(); {1339#true} is VALID [2022-04-07 12:21:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:21:31,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229402684] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:21:31,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:21:31,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:21:31,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153611933] [2022-04-07 12:21:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:21:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-07 12:21:31,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:21:31,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:21:34,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:21:34,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:21:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:21:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:21:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:21:34,138 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:21:36,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:38,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:40,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:42,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:49,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:53,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:02,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:04,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:04,410 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-07 12:22:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:22:04,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-07 12:22:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:22:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-07 12:22:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-07 12:22:04,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-07 12:22:08,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 45 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:22:08,720 INFO L225 Difference]: With dead ends: 66 [2022-04-07 12:22:08,721 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 12:22:08,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:22:08,721 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:22:08,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 17.3s Time] [2022-04-07 12:22:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 12:22:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-04-07 12:22:08,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:22:08,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:22:08,742 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:22:08,742 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:22:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:08,744 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-04-07 12:22:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-04-07 12:22:08,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:08,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:08,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 64 states. [2022-04-07 12:22:08,745 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 64 states. [2022-04-07 12:22:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:08,746 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-04-07 12:22:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-04-07 12:22:08,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:08,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:08,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:22:08,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:22:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:22:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-07 12:22:08,752 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 25 [2022-04-07 12:22:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:22:08,753 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-07 12:22:08,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-07 12:22:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 12:22:08,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:22:08,754 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:22:08,770 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-07 12:22:08,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:22:08,968 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:22:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:22:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1147898952, now seen corresponding path program 1 times [2022-04-07 12:22:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:22:08,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953850734] [2022-04-07 12:22:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:22:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:22:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:22:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:09,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {1807#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1796#true} is VALID [2022-04-07 12:22:09,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#true} {1796#true} #86#return; {1796#true} is VALID [2022-04-07 12:22:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:22:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:09,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {1796#true} ~cond := #in~cond; {1796#true} is VALID [2022-04-07 12:22:09,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#true} assume !(0 == ~cond); {1796#true} is VALID [2022-04-07 12:22:09,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #84#return; {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1807#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:22:09,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1796#true} is VALID [2022-04-07 12:22:09,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #86#return; {1796#true} is VALID [2022-04-07 12:22:09,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret5 := main(); {1796#true} is VALID [2022-04-07 12:22:09,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1801#(= main_~l~0 0)} is VALID [2022-04-07 12:22:09,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1801#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1801#(= main_~l~0 0)} is VALID [2022-04-07 12:22:09,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {1801#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1801#(= main_~l~0 0)} is VALID [2022-04-07 12:22:09,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {1801#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1801#(= main_~l~0 0)} is VALID [2022-04-07 12:22:09,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1801#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1796#true} is VALID [2022-04-07 12:22:09,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#true} ~cond := #in~cond; {1796#true} is VALID [2022-04-07 12:22:09,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#true} assume !(0 == ~cond); {1796#true} is VALID [2022-04-07 12:22:09,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,071 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1796#true} {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #84#return; {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:22:09,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {1802#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1797#false} is VALID [2022-04-07 12:22:09,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#false} ~l~0 := 1 + ~l~0; {1797#false} is VALID [2022-04-07 12:22:09,074 INFO L272 TraceCheckUtils]: 22: Hoare triple {1797#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-07 12:22:09,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-07 12:22:09,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-07 12:22:09,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-07 12:22:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:22:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:22:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953850734] [2022-04-07 12:22:09,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953850734] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:22:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642194556] [2022-04-07 12:22:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:22:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:22:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:22:09,075 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-07 12:22:09,077 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-07 12:22:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:09,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:22:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:09,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:22:09,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1796#true} is VALID [2022-04-07 12:22:09,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#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; {1796#true} is VALID [2022-04-07 12:22:09,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #86#return; {1796#true} is VALID [2022-04-07 12:22:09,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret5 := main(); {1796#true} is VALID [2022-04-07 12:22:09,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1826#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {1826#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1826#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {1826#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1826#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1826#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1836#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,660 INFO L272 TraceCheckUtils]: 10: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1796#true} is VALID [2022-04-07 12:22:09,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#true} ~cond := #in~cond; {1796#true} is VALID [2022-04-07 12:22:09,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#true} assume !(0 == ~cond); {1796#true} is VALID [2022-04-07 12:22:09,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,661 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1796#true} {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {1840#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1874#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {1874#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1878#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:09,669 INFO L272 TraceCheckUtils]: 22: Hoare triple {1878#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:22:09,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {1882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:22:09,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1797#false} is VALID [2022-04-07 12:22:09,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-07 12:22:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:22:09,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:22:09,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-07 12:22:09,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1797#false} is VALID [2022-04-07 12:22:09,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {1882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:22:09,978 INFO L272 TraceCheckUtils]: 22: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:22:09,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {1906#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1906#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:22:09,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,996 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1796#true} {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:09,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:09,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {1796#true} assume !(0 == ~cond); {1796#true} is VALID [2022-04-07 12:22:09,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#true} ~cond := #in~cond; {1796#true} is VALID [2022-04-07 12:22:09,997 INFO L272 TraceCheckUtils]: 10: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1796#true} is VALID [2022-04-07 12:22:09,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {1906#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:10,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {1906#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:22:10,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:10,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:10,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1902#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:10,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret5 := main(); {1796#true} is VALID [2022-04-07 12:22:10,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #86#return; {1796#true} is VALID [2022-04-07 12:22:10,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-07 12:22:10,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#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; {1796#true} is VALID [2022-04-07 12:22:10,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1796#true} is VALID [2022-04-07 12:22:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:22:10,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642194556] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:22:10,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:22:10,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:22:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019741908] [2022-04-07 12:22:10,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:22:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-07 12:22:10,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:22:10,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:10,134 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-07 12:22:10,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:22:10,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:22:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:22:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:22:10,135 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:12,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:14,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:16,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:18,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:20,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:22,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:25,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:27,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:29,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:31,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:33,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:35,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:37,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:42,374 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2022-04-07 12:22:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:22:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-07 12:22:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:22:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:22:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:22:42,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:22:42,438 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-07 12:22:42,439 INFO L225 Difference]: With dead ends: 71 [2022-04-07 12:22:42,439 INFO L226 Difference]: Without dead ends: 69 [2022-04-07 12:22:42,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:22:42,440 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-04-07 12:22:42,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 27.7s Time] [2022-04-07 12:22:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-07 12:22:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-07 12:22:42,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:22:42,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:22:42,472 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:22:42,472 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:22:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:42,474 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-07 12:22:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-07 12:22:42,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:42,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:42,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 69 states. [2022-04-07 12:22:42,474 INFO L87 Difference]: Start difference. First operand has 68 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 69 states. [2022-04-07 12:22:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:22:42,476 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-07 12:22:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-07 12:22:42,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:22:42,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:22:42,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:22:42,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:22:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:22:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-04-07 12:22:42,478 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 26 [2022-04-07 12:22:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:22:42,478 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-04-07 12:22:42,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-04-07 12:22:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 12:22:42,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:22:42,479 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:22:42,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 12:22:42,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:22:42,697 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:22:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:22:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1573409299, now seen corresponding path program 1 times [2022-04-07 12:22:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:22:42,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571531965] [2022-04-07 12:22:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:22:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:22:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:22:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:42,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {2305#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:22:42,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:22:42,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2291#true} #86#return; {2296#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:22:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:22:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:42,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {2291#true} ~cond := #in~cond; {2291#true} is VALID [2022-04-07 12:22:42,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {2291#true} assume !(0 == ~cond); {2291#true} is VALID [2022-04-07 12:22:42,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {2291#true} assume true; {2291#true} is VALID [2022-04-07 12:22:42,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2291#true} {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} #84#return; {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-07 12:22:42,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {2291#true} call ULTIMATE.init(); {2305#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:22:42,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:22:42,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:22:42,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2306#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2291#true} #86#return; {2296#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:22:42,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {2296#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {2296#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:22:42,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {2296#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2297#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:22:42,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {2297#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2298#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:22:42,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {2298#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2298#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:22:42,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2298#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {2298#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:22:42,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {2298#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-07 12:22:42,916 INFO L272 TraceCheckUtils]: 10: Hoare triple {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2291#true} is VALID [2022-04-07 12:22:42,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {2291#true} ~cond := #in~cond; {2291#true} is VALID [2022-04-07 12:22:42,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {2291#true} assume !(0 == ~cond); {2291#true} is VALID [2022-04-07 12:22:42,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {2291#true} assume true; {2291#true} is VALID [2022-04-07 12:22:42,917 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2291#true} {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} #84#return; {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-07 12:22:42,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {2299#(<= (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) main_~n~0 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2127483648 (* 9223372041149743104 (div main_~l~0 4294967296))) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296)))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-07 12:22:42,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-07 12:22:42,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-07 12:22:42,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-07 12:22:42,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-07 12:22:42,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-07 12:22:42,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {2304#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2292#false} is VALID [2022-04-07 12:22:42,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {2292#false} ~l~0 := 1 + ~l~0; {2292#false} is VALID [2022-04-07 12:22:42,922 INFO L272 TraceCheckUtils]: 23: Hoare triple {2292#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2292#false} is VALID [2022-04-07 12:22:42,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {2292#false} ~cond := #in~cond; {2292#false} is VALID [2022-04-07 12:22:42,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {2292#false} assume 0 == ~cond; {2292#false} is VALID [2022-04-07 12:22:42,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {2292#false} assume !false; {2292#false} is VALID [2022-04-07 12:22:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:22:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:22:42,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571531965] [2022-04-07 12:22:42,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571531965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:22:42,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985101371] [2022-04-07 12:22:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:22:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:22:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:22:42,924 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-07 12:22:42,925 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-07 12:22:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:42,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:22:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:22:42,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:22:43,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {2291#true} call ULTIMATE.init(); {2291#true} is VALID [2022-04-07 12:22:43,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2291#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; {2291#true} is VALID [2022-04-07 12:22:43,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {2291#true} assume true; {2291#true} is VALID [2022-04-07 12:22:43,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2291#true} {2291#true} #86#return; {2291#true} is VALID [2022-04-07 12:22:43,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {2291#true} call #t~ret5 := main(); {2291#true} is VALID [2022-04-07 12:22:43,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {2291#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2325#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {2325#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2325#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {2325#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2325#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {2335#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {2335#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,608 INFO L272 TraceCheckUtils]: 10: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2291#true} is VALID [2022-04-07 12:22:43,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {2291#true} ~cond := #in~cond; {2291#true} is VALID [2022-04-07 12:22:43,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {2291#true} assume !(0 == ~cond); {2291#true} is VALID [2022-04-07 12:22:43,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {2291#true} assume true; {2291#true} is VALID [2022-04-07 12:22:43,609 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2291#true} {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {2339#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2376#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {2376#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2380#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:22:43,613 INFO L272 TraceCheckUtils]: 23: Hoare triple {2380#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2384#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:22:43,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {2384#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2388#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:22:43,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {2388#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2292#false} is VALID [2022-04-07 12:22:43,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {2292#false} assume !false; {2292#false} is VALID [2022-04-07 12:22:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:22:43,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:22:43,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {2292#false} assume !false; {2292#false} is VALID [2022-04-07 12:22:43,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {2388#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2292#false} is VALID [2022-04-07 12:22:43,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {2384#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2388#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:22:43,909 INFO L272 TraceCheckUtils]: 23: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2384#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:22:43,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {2408#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,016 WARN L290 TraceCheckUtils]: 21: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2408#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:22:46,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,020 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2291#true} {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {2291#true} assume true; {2291#true} is VALID [2022-04-07 12:22:46,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {2291#true} assume !(0 == ~cond); {2291#true} is VALID [2022-04-07 12:22:46,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {2291#true} ~cond := #in~cond; {2291#true} is VALID [2022-04-07 12:22:46,020 INFO L272 TraceCheckUtils]: 10: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2291#true} is VALID [2022-04-07 12:22:46,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {2408#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {2408#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:22:46,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {2291#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2404#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:22:46,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {2291#true} call #t~ret5 := main(); {2291#true} is VALID [2022-04-07 12:22:46,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2291#true} {2291#true} #86#return; {2291#true} is VALID [2022-04-07 12:22:46,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {2291#true} assume true; {2291#true} is VALID [2022-04-07 12:22:46,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {2291#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; {2291#true} is VALID [2022-04-07 12:22:46,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {2291#true} call ULTIMATE.init(); {2291#true} is VALID [2022-04-07 12:22:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:22:46,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985101371] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:22:46,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:22:46,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 18 [2022-04-07 12:22:46,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136273208] [2022-04-07 12:22:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:22:46,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-07 12:22:46,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:22:46,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:48,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:22:48,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:22:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:22:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:22:48,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:22:48,180 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:22:50,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:52,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:54,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:56,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:58,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:01,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:03,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:05,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:07,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:07,756 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2022-04-07 12:23:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:23:07,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-07 12:23:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:23:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:23:07,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:23:09,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:09,964 INFO L225 Difference]: With dead ends: 83 [2022-04-07 12:23:09,964 INFO L226 Difference]: Without dead ends: 81 [2022-04-07 12:23:09,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-04-07 12:23:09,965 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:09,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 19.4s Time] [2022-04-07 12:23:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-07 12:23:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-04-07 12:23:09,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:09,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:23:09,995 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:23:09,996 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:23:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:09,998 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2022-04-07 12:23:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2022-04-07 12:23:09,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:09,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:09,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 81 states. [2022-04-07 12:23:09,999 INFO L87 Difference]: Start difference. First operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 81 states. [2022-04-07 12:23:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:10,001 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2022-04-07 12:23:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2022-04-07 12:23:10,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:10,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:10,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:10,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:23:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-04-07 12:23:10,003 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 27 [2022-04-07 12:23:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:10,003 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-04-07 12:23:10,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-07 12:23:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 12:23:10,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:10,004 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:10,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 12:23:10,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:10,220 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 108526595, now seen corresponding path program 1 times [2022-04-07 12:23:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:10,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558698112] [2022-04-07 12:23:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:10,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {2847#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2836#true} is VALID [2022-04-07 12:23:10,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:10,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2836#true} {2836#true} #86#return; {2836#true} is VALID [2022-04-07 12:23:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:23:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:10,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-07 12:23:10,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-07 12:23:10,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:10,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2836#true} {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2847#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:10,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2836#true} is VALID [2022-04-07 12:23:10,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:10,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2836#true} {2836#true} #86#return; {2836#true} is VALID [2022-04-07 12:23:10,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {2836#true} call #t~ret5 := main(); {2836#true} is VALID [2022-04-07 12:23:10,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {2836#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2841#(= main_~l~0 0)} is VALID [2022-04-07 12:23:10,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {2841#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2841#(= main_~l~0 0)} is VALID [2022-04-07 12:23:10,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2841#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2841#(= main_~l~0 0)} is VALID [2022-04-07 12:23:10,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {2841#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {2841#(= main_~l~0 0)} is VALID [2022-04-07 12:23:10,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {2841#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,286 INFO L272 TraceCheckUtils]: 10: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2836#true} is VALID [2022-04-07 12:23:10,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-07 12:23:10,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-07 12:23:10,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:10,287 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2836#true} {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:10,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {2837#false} is VALID [2022-04-07 12:23:10,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {2837#false} ~l~0 := 1 + ~l~0; {2837#false} is VALID [2022-04-07 12:23:10,290 INFO L272 TraceCheckUtils]: 24: Hoare triple {2837#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2837#false} is VALID [2022-04-07 12:23:10,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-07 12:23:10,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-07 12:23:10,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-07 12:23:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:10,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558698112] [2022-04-07 12:23:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558698112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078369990] [2022-04-07 12:23:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:10,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:10,291 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-07 12:23:10,322 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-07 12:23:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:10,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:23:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:10,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:10,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-07 12:23:10,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#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; {2836#true} is VALID [2022-04-07 12:23:10,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:10,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2836#true} {2836#true} #86#return; {2836#true} is VALID [2022-04-07 12:23:10,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {2836#true} call #t~ret5 := main(); {2836#true} is VALID [2022-04-07 12:23:10,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {2836#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2866#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {2866#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2866#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {2866#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2866#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {2866#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {2876#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {2876#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,905 INFO L272 TraceCheckUtils]: 10: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2836#true} is VALID [2022-04-07 12:23:10,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-07 12:23:10,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-07 12:23:10,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:10,906 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2836#true} {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {2880#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {2920#(and (= main_~j~0 1) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {2920#(and (= main_~j~0 1) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2924#(and (= main_~j~0 1) (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:10,910 INFO L272 TraceCheckUtils]: 24: Hoare triple {2924#(and (= main_~j~0 1) (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:23:10,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {2928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:23:10,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2837#false} is VALID [2022-04-07 12:23:10,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-07 12:23:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:23:10,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:11,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-07 12:23:11,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2837#false} is VALID [2022-04-07 12:23:11,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {2928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:23:11,152 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:23:11,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {2952#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {2952#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:23:11,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,172 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2836#true} {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:11,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-07 12:23:11,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-07 12:23:11,172 INFO L272 TraceCheckUtils]: 10: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2836#true} is VALID [2022-04-07 12:23:11,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {2952#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:23:11,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2836#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2948#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:11,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2836#true} call #t~ret5 := main(); {2836#true} is VALID [2022-04-07 12:23:11,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2836#true} {2836#true} #86#return; {2836#true} is VALID [2022-04-07 12:23:11,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-07 12:23:11,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#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; {2836#true} is VALID [2022-04-07 12:23:11,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-07 12:23:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:23:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078369990] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:11,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:23:11,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 12:23:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321818578] [2022-04-07 12:23:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:23:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-07 12:23:11,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:11,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:11,308 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-07 12:23:11,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:23:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:23:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:23:11,308 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:13,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:15,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:17,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:22,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:24,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:26,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:28,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:30,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:32,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:34,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:36,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:39,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:41,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:43,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:45,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:47,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:47,919 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2022-04-07 12:23:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:23:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-07 12:23:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:23:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:23:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:23:47,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-07 12:23:48,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:48,032 INFO L225 Difference]: With dead ends: 98 [2022-04-07 12:23:48,032 INFO L226 Difference]: Without dead ends: 96 [2022-04-07 12:23:48,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:23:48,033 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:23:48,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 16 Unknown, 0 Unchecked, 34.0s Time] [2022-04-07 12:23:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-07 12:23:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-07 12:23:48,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:23:48,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 12:23:48,060 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 12:23:48,060 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 12:23:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:48,062 INFO L93 Difference]: Finished difference Result 96 states and 132 transitions. [2022-04-07 12:23:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2022-04-07 12:23:48,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:48,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:48,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-04-07 12:23:48,062 INFO L87 Difference]: Start difference. First operand has 96 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-04-07 12:23:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:23:48,064 INFO L93 Difference]: Finished difference Result 96 states and 132 transitions. [2022-04-07 12:23:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2022-04-07 12:23:48,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:23:48,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:23:48,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:23:48,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:23:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 12:23:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2022-04-07 12:23:48,066 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 28 [2022-04-07 12:23:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:23:48,067 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2022-04-07 12:23:48,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2022-04-07 12:23:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 12:23:48,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:23:48,067 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:23:48,085 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-07 12:23:48,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:48,283 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:23:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:23:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1795383072, now seen corresponding path program 1 times [2022-04-07 12:23:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:23:48,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812835513] [2022-04-07 12:23:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:23:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:23:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:48,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {3480#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3464#true} is VALID [2022-04-07 12:23:48,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:48,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3464#true} {3464#true} #86#return; {3464#true} is VALID [2022-04-07 12:23:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:23:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:48,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:48,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:48,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:48,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-07 12:23:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:48,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:48,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:48,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:48,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:23:48,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3480#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:23:48,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3464#true} is VALID [2022-04-07 12:23:48,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:48,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #86#return; {3464#true} is VALID [2022-04-07 12:23:48,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret5 := main(); {3464#true} is VALID [2022-04-07 12:23:48,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {3464#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3469#(= main_~l~0 0)} is VALID [2022-04-07 12:23:48,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {3469#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3469#(= main_~l~0 0)} is VALID [2022-04-07 12:23:48,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {3469#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3469#(= main_~l~0 0)} is VALID [2022-04-07 12:23:48,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {3469#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {3469#(= main_~l~0 0)} is VALID [2022-04-07 12:23:48,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {3469#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3464#true} is VALID [2022-04-07 12:23:48,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:48,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:48,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:48,445 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3464#true} {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:23:48,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {3470#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:23:48,448 INFO L272 TraceCheckUtils]: 20: Hoare triple {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3464#true} is VALID [2022-04-07 12:23:48,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:48,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:48,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:48,448 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3464#true} {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:23:48,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:23:48,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:23:48,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {3475#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {3465#false} is VALID [2022-04-07 12:23:48,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {3465#false} ~l~0 := 1 + ~l~0; {3465#false} is VALID [2022-04-07 12:23:48,451 INFO L272 TraceCheckUtils]: 29: Hoare triple {3465#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3465#false} is VALID [2022-04-07 12:23:48,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {3465#false} ~cond := #in~cond; {3465#false} is VALID [2022-04-07 12:23:48,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {3465#false} assume 0 == ~cond; {3465#false} is VALID [2022-04-07 12:23:48,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2022-04-07 12:23:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:23:48,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:23:48,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812835513] [2022-04-07 12:23:48,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812835513] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:48,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560521340] [2022-04-07 12:23:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:23:48,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:23:48,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:23:48,453 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-07 12:23:48,454 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-07 12:23:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:48,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:23:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:23:48,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:23:49,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3464#true} is VALID [2022-04-07 12:23:49,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#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; {3464#true} is VALID [2022-04-07 12:23:49,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:49,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #86#return; {3464#true} is VALID [2022-04-07 12:23:49,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret5 := main(); {3464#true} is VALID [2022-04-07 12:23:49,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {3464#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3499#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {3499#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3499#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {3499#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3499#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {3499#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {3509#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {3509#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,187 INFO L272 TraceCheckUtils]: 10: Hoare triple {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3464#true} is VALID [2022-04-07 12:23:49,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:49,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:49,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:49,187 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3464#true} {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {3513#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3541#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {3541#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,190 INFO L272 TraceCheckUtils]: 20: Hoare triple {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3464#true} is VALID [2022-04-07 12:23:49,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:49,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:49,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:49,191 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3464#true} {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {3545#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {3570#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {3570#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3574#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:23:49,193 INFO L272 TraceCheckUtils]: 29: Hoare triple {3574#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:23:49,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {3578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:23:49,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {3582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3465#false} is VALID [2022-04-07 12:23:49,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2022-04-07 12:23:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:23:49,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:23:49,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2022-04-07 12:23:49,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {3582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3465#false} is VALID [2022-04-07 12:23:49,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {3578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:23:49,491 INFO L272 TraceCheckUtils]: 29: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:23:49,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {3602#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:51,599 WARN L290 TraceCheckUtils]: 27: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {3602#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:23:51,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:51,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:51,602 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3464#true} {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:51,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:51,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:51,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:51,602 INFO L272 TraceCheckUtils]: 20: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3464#true} is VALID [2022-04-07 12:23:51,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {3602#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,721 WARN L290 TraceCheckUtils]: 18: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3602#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:23:53,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,724 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3464#true} {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:53,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {3464#true} assume !(0 == ~cond); {3464#true} is VALID [2022-04-07 12:23:53,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {3464#true} ~cond := #in~cond; {3464#true} is VALID [2022-04-07 12:23:53,724 INFO L272 TraceCheckUtils]: 10: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3464#true} is VALID [2022-04-07 12:23:53,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {3602#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {3602#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:23:53,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {3464#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:23:53,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret5 := main(); {3464#true} is VALID [2022-04-07 12:23:53,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #86#return; {3464#true} is VALID [2022-04-07 12:23:53,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-07 12:23:53,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#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; {3464#true} is VALID [2022-04-07 12:23:53,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3464#true} is VALID [2022-04-07 12:23:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 12:23:53,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560521340] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:23:53,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:23:53,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-07 12:23:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830187080] [2022-04-07 12:23:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:23:53,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-07 12:23:53,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:23:53,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:23:57,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 21 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:23:57,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:23:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:23:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:23:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:23:57,996 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:24:00,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:02,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:06,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:08,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:15,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:19,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:26,384 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2022-04-07 12:24:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:24:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-07 12:24:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:24:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:24:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 12:24:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:24:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 12:24:26,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 12:24:30,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 43 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:30,741 INFO L225 Difference]: With dead ends: 118 [2022-04-07 12:24:30,741 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 12:24:30,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:24:30,742 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-07 12:24:30,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 12.7s Time] [2022-04-07 12:24:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 12:24:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-04-07 12:24:30,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:24:30,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 107 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:24:30,771 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 107 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:24:30,772 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 107 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:24:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:30,780 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-04-07 12:24:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2022-04-07 12:24:30,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:24:30,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:24:30,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 116 states. [2022-04-07 12:24:30,783 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 116 states. [2022-04-07 12:24:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:24:30,785 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-04-07 12:24:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2022-04-07 12:24:30,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:24:30,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:24:30,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:24:30,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:24:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:24:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2022-04-07 12:24:30,787 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 33 [2022-04-07 12:24:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:24:30,787 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2022-04-07 12:24:30,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:24:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2022-04-07 12:24:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 12:24:30,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:24:30,788 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:24:30,815 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-07 12:24:31,004 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,SelfDestructingSolverStorable8 [2022-04-07 12:24:31,005 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:24:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:24:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1119304443, now seen corresponding path program 1 times [2022-04-07 12:24:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:24:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018414510] [2022-04-07 12:24:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:24:31,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:24:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:24:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:31,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {4227#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:24:31,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:24:31,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {4209#true} #86#return; {4214#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:24:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:24:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:31,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:31,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:31,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4209#true} {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} #84#return; {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 12:24:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:31,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:31,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:31,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4209#true} {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:24:31,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {4209#true} call ULTIMATE.init(); {4227#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:24:31,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {4227#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:24:31,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:24:31,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {4209#true} #86#return; {4214#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:24:31,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {4214#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {4214#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:24:31,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {4214#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4215#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:24:31,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {4215#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4216#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:24:31,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {4216#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4216#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:24:31,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {4216#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {4216#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:24:31,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {4216#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4209#true} is VALID [2022-04-07 12:24:31,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:31,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:31,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,268 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4209#true} {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} #84#return; {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:24:31,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {4217#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} ~l~0 := 1 + ~l~0; {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:24:31,272 INFO L272 TraceCheckUtils]: 21: Hoare triple {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4209#true} is VALID [2022-04-07 12:24:31,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:31,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:31,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,273 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4209#true} {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:24:31,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:24:31,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:24:31,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {4222#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {4210#false} is VALID [2022-04-07 12:24:31,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {4210#false} ~l~0 := 1 + ~l~0; {4210#false} is VALID [2022-04-07 12:24:31,275 INFO L272 TraceCheckUtils]: 30: Hoare triple {4210#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4210#false} is VALID [2022-04-07 12:24:31,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {4210#false} ~cond := #in~cond; {4210#false} is VALID [2022-04-07 12:24:31,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {4210#false} assume 0 == ~cond; {4210#false} is VALID [2022-04-07 12:24:31,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {4210#false} assume !false; {4210#false} is VALID [2022-04-07 12:24:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:24:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:24:31,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018414510] [2022-04-07 12:24:31,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018414510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:24:31,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752551794] [2022-04-07 12:24:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:24:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:24:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:24:31,277 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-07 12:24:31,278 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-07 12:24:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:31,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:24:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:24:31,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:24:31,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {4209#true} call ULTIMATE.init(); {4209#true} is VALID [2022-04-07 12:24:31,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {4209#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; {4209#true} is VALID [2022-04-07 12:24:31,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4209#true} {4209#true} #86#return; {4209#true} is VALID [2022-04-07 12:24:31,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {4209#true} call #t~ret5 := main(); {4209#true} is VALID [2022-04-07 12:24:31,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {4209#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4247#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {4247#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4247#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {4247#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4247#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {4247#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {4257#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {4257#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,963 INFO L272 TraceCheckUtils]: 10: Hoare triple {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4209#true} is VALID [2022-04-07 12:24:31,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:31,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:31,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,964 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4209#true} {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:24:31,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {4261#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4292#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {4292#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,966 INFO L272 TraceCheckUtils]: 21: Hoare triple {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4209#true} is VALID [2022-04-07 12:24:31,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:31,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:31,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:31,967 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4209#true} {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} #84#return; {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {4296#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {4321#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {4321#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {4325#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:24:31,969 INFO L272 TraceCheckUtils]: 30: Hoare triple {4325#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:24:31,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {4329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:24:31,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {4333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4210#false} is VALID [2022-04-07 12:24:31,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {4210#false} assume !false; {4210#false} is VALID [2022-04-07 12:24:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:24:31,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:24:32,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {4210#false} assume !false; {4210#false} is VALID [2022-04-07 12:24:32,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {4333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4210#false} is VALID [2022-04-07 12:24:32,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {4329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:24:32,325 INFO L272 TraceCheckUtils]: 30: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:24:32,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {4353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:34,437 WARN L290 TraceCheckUtils]: 28: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {4353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:24:34,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:34,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:34,438 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4209#true} {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:34,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:34,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:34,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:34,439 INFO L272 TraceCheckUtils]: 21: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4209#true} is VALID [2022-04-07 12:24:34,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {4353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,554 WARN L290 TraceCheckUtils]: 19: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:24:36,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,557 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4209#true} {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:36,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {4209#true} assume !(0 == ~cond); {4209#true} is VALID [2022-04-07 12:24:36,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {4209#true} ~cond := #in~cond; {4209#true} is VALID [2022-04-07 12:24:36,557 INFO L272 TraceCheckUtils]: 10: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4209#true} is VALID [2022-04-07 12:24:36,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {4353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {4353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:24:36,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {4209#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:24:36,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {4209#true} call #t~ret5 := main(); {4209#true} is VALID [2022-04-07 12:24:36,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4209#true} {4209#true} #86#return; {4209#true} is VALID [2022-04-07 12:24:36,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {4209#true} assume true; {4209#true} is VALID [2022-04-07 12:24:36,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {4209#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; {4209#true} is VALID [2022-04-07 12:24:36,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {4209#true} call ULTIMATE.init(); {4209#true} is VALID [2022-04-07 12:24:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 12:24:36,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752551794] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:24:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:24:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-07 12:24:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473137124] [2022-04-07 12:24:36,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:24:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-07 12:24:36,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:24:36,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:24:40,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 22 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:24:40,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:24:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:24:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:24:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-04-07 12:24:40,868 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:24:42,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:45,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:47,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:49,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:51,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:55,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:00,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:02,669 INFO L93 Difference]: Finished difference Result 141 states and 192 transitions. [2022-04-07 12:25:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:25:02,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-07 12:25:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-07 12:25:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-07 12:25:02,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-07 12:25:06,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 45 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:06,935 INFO L225 Difference]: With dead ends: 141 [2022-04-07 12:25:06,935 INFO L226 Difference]: Without dead ends: 139 [2022-04-07 12:25:06,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:25:06,936 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:06,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 14.5s Time] [2022-04-07 12:25:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-07 12:25:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-07 12:25:06,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:06,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:25:06,985 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:25:06,986 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:25:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:06,988 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2022-04-07 12:25:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2022-04-07 12:25:06,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:06,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:06,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 139 states. [2022-04-07 12:25:06,988 INFO L87 Difference]: Start difference. First operand has 139 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 139 states. [2022-04-07 12:25:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:06,990 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2022-04-07 12:25:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2022-04-07 12:25:06,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:06,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:06,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:06,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:25:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2022-04-07 12:25:06,993 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 34 [2022-04-07 12:25:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:06,993 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2022-04-07 12:25:06,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2022-04-07 12:25:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 12:25:06,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:06,994 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:07,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 12:25:07,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 12:25:07,222 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 228128645, now seen corresponding path program 1 times [2022-04-07 12:25:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:07,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971315678] [2022-04-07 12:25:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:07,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:07,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {5094#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5079#true} is VALID [2022-04-07 12:25:07,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5079#true} {5079#true} #86#return; {5079#true} is VALID [2022-04-07 12:25:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:25:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:07,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:07,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:07,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5079#true} {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #84#return; {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 12:25:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:07,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:07,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:07,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5079#true} {5080#false} #84#return; {5080#false} is VALID [2022-04-07 12:25:07,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {5079#true} call ULTIMATE.init(); {5094#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:07,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {5094#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5079#true} is VALID [2022-04-07 12:25:07,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5079#true} {5079#true} #86#return; {5079#true} is VALID [2022-04-07 12:25:07,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {5079#true} call #t~ret5 := main(); {5079#true} is VALID [2022-04-07 12:25:07,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {5079#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5084#(= main_~l~0 0)} is VALID [2022-04-07 12:25:07,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {5084#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5084#(= main_~l~0 0)} is VALID [2022-04-07 12:25:07,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {5084#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5084#(= main_~l~0 0)} is VALID [2022-04-07 12:25:07,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {5084#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {5084#(= main_~l~0 0)} is VALID [2022-04-07 12:25:07,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {5084#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,294 INFO L272 TraceCheckUtils]: 10: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5079#true} is VALID [2022-04-07 12:25:07,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:07,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:07,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,295 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5079#true} {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #84#return; {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 12:25:07,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {5085#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {5080#false} is VALID [2022-04-07 12:25:07,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {5080#false} ~l~0 := 1 + ~l~0; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L272 TraceCheckUtils]: 22: Hoare triple {5080#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5079#true} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,298 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5079#true} {5080#false} #84#return; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {5080#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {5080#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {5080#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {5080#false} ~l~0 := 1 + ~l~0; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L272 TraceCheckUtils]: 31: Hoare triple {5080#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {5080#false} ~cond := #in~cond; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {5080#false} assume 0 == ~cond; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#false} assume !false; {5080#false} is VALID [2022-04-07 12:25:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 12:25:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:07,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971315678] [2022-04-07 12:25:07,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971315678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:25:07,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231693979] [2022-04-07 12:25:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:07,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:25:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:25:07,300 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-07 12:25:07,301 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-07 12:25:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:07,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:25:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:07,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:25:07,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {5079#true} call ULTIMATE.init(); {5079#true} is VALID [2022-04-07 12:25:07,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#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; {5079#true} is VALID [2022-04-07 12:25:07,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5079#true} {5079#true} #86#return; {5079#true} is VALID [2022-04-07 12:25:07,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {5079#true} call #t~ret5 := main(); {5079#true} is VALID [2022-04-07 12:25:07,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {5079#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5113#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {5113#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5113#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {5113#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5113#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5113#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {5123#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {5123#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,993 INFO L272 TraceCheckUtils]: 10: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5079#true} is VALID [2022-04-07 12:25:07,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:07,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:07,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,994 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5079#true} {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {5127#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {5161#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {5161#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,996 INFO L272 TraceCheckUtils]: 22: Hoare triple {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5079#true} is VALID [2022-04-07 12:25:07,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:07,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:07,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:07,997 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5079#true} {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {5165#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5190#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:07,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {5190#(and (= main_~l~0 2) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5194#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:08,000 INFO L272 TraceCheckUtils]: 31: Hoare triple {5194#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:25:08,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {5198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:25:08,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {5202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5080#false} is VALID [2022-04-07 12:25:08,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#false} assume !false; {5080#false} is VALID [2022-04-07 12:25:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:25:08,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:25:08,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#false} assume !false; {5080#false} is VALID [2022-04-07 12:25:08,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {5202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5080#false} is VALID [2022-04-07 12:25:08,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {5198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:25:08,293 INFO L272 TraceCheckUtils]: 31: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:25:08,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {5222#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,402 WARN L290 TraceCheckUtils]: 29: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5222#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:25:10,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,403 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5079#true} {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:10,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:10,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:10,404 INFO L272 TraceCheckUtils]: 22: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5079#true} is VALID [2022-04-07 12:25:10,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {5222#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {5222#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:25:10,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,586 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5079#true} {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:10,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {5079#true} assume !(0 == ~cond); {5079#true} is VALID [2022-04-07 12:25:10,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#true} ~cond := #in~cond; {5079#true} is VALID [2022-04-07 12:25:10,586 INFO L272 TraceCheckUtils]: 10: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5079#true} is VALID [2022-04-07 12:25:10,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {5222#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {5222#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:25:10,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {5079#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5218#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:10,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {5079#true} call #t~ret5 := main(); {5079#true} is VALID [2022-04-07 12:25:10,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5079#true} {5079#true} #86#return; {5079#true} is VALID [2022-04-07 12:25:10,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {5079#true} assume true; {5079#true} is VALID [2022-04-07 12:25:10,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {5079#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; {5079#true} is VALID [2022-04-07 12:25:10,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {5079#true} call ULTIMATE.init(); {5079#true} is VALID [2022-04-07 12:25:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 12:25:10,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231693979] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:25:10,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:25:10,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-07 12:25:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322521166] [2022-04-07 12:25:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:25:10,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-07 12:25:10,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:10,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:12,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:12,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:25:12,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:12,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:25:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:25:12,746 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:14,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:17,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:19,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:21,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:23,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:25,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:27,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:28,038 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2022-04-07 12:25:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:25:28,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-07 12:25:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:25:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:25:28,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:25:30,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:30,304 INFO L225 Difference]: With dead ends: 155 [2022-04-07 12:25:30,304 INFO L226 Difference]: Without dead ends: 153 [2022-04-07 12:25:30,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:25:30,305 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:30,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 14.6s Time] [2022-04-07 12:25:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-07 12:25:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-04-07 12:25:30,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:30,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 152 states, 124 states have (on average 1.467741935483871) internal successors, (182), 124 states have internal predecessors, (182), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:25:30,356 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 152 states, 124 states have (on average 1.467741935483871) internal successors, (182), 124 states have internal predecessors, (182), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:25:30,356 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 152 states, 124 states have (on average 1.467741935483871) internal successors, (182), 124 states have internal predecessors, (182), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:25:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:30,359 INFO L93 Difference]: Finished difference Result 153 states and 211 transitions. [2022-04-07 12:25:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2022-04-07 12:25:30,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:30,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:30,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 124 states have (on average 1.467741935483871) internal successors, (182), 124 states have internal predecessors, (182), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 153 states. [2022-04-07 12:25:30,360 INFO L87 Difference]: Start difference. First operand has 152 states, 124 states have (on average 1.467741935483871) internal successors, (182), 124 states have internal predecessors, (182), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 153 states. [2022-04-07 12:25:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:30,362 INFO L93 Difference]: Finished difference Result 153 states and 211 transitions. [2022-04-07 12:25:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2022-04-07 12:25:30,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:30,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:30,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:30,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 124 states have (on average 1.467741935483871) internal successors, (182), 124 states have internal predecessors, (182), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:25:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2022-04-07 12:25:30,366 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 35 [2022-04-07 12:25:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:30,366 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2022-04-07 12:25:30,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2022-04-07 12:25:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 12:25:30,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:30,367 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:30,391 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-07 12:25:30,583 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,SelfDestructingSolverStorable10 [2022-04-07 12:25:30,583 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:30,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1934793473, now seen corresponding path program 1 times [2022-04-07 12:25:30,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:30,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3518841] [2022-04-07 12:25:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:30,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {6028#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {6012#true} is VALID [2022-04-07 12:25:30,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:30,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6012#true} {6012#true} #86#return; {6012#true} is VALID [2022-04-07 12:25:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:25:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:30,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:30,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:30,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:30,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-07 12:25:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:30,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:30,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:30,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:30,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #84#return; {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6028#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:30,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {6028#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {6012#true} is VALID [2022-04-07 12:25:30,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:30,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #86#return; {6012#true} is VALID [2022-04-07 12:25:30,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret5 := main(); {6012#true} is VALID [2022-04-07 12:25:30,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {6012#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6017#(= main_~l~0 0)} is VALID [2022-04-07 12:25:30,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {6017#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6017#(= main_~l~0 0)} is VALID [2022-04-07 12:25:30,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {6017#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6017#(= main_~l~0 0)} is VALID [2022-04-07 12:25:30,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {6017#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {6017#(= main_~l~0 0)} is VALID [2022-04-07 12:25:30,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {6017#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,671 INFO L272 TraceCheckUtils]: 10: Hoare triple {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6012#true} is VALID [2022-04-07 12:25:30,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:30,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:30,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:30,672 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6012#true} {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:25:30,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {6018#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,674 INFO L272 TraceCheckUtils]: 20: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6012#true} is VALID [2022-04-07 12:25:30,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:30,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:30,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:30,675 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6012#true} {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #84#return; {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:25:30,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {6023#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {6013#false} is VALID [2022-04-07 12:25:30,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {6013#false} ~l~0 := 1 + ~l~0; {6013#false} is VALID [2022-04-07 12:25:30,678 INFO L272 TraceCheckUtils]: 32: Hoare triple {6013#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6013#false} is VALID [2022-04-07 12:25:30,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {6013#false} ~cond := #in~cond; {6013#false} is VALID [2022-04-07 12:25:30,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {6013#false} assume 0 == ~cond; {6013#false} is VALID [2022-04-07 12:25:30,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2022-04-07 12:25:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:25:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3518841] [2022-04-07 12:25:30,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3518841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:25:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567015004] [2022-04-07 12:25:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:30,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:25:30,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:25:30,680 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-07 12:25:30,681 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-07 12:25:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:30,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:25:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:30,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:25:31,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6012#true} is VALID [2022-04-07 12:25:31,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#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; {6012#true} is VALID [2022-04-07 12:25:31,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:31,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #86#return; {6012#true} is VALID [2022-04-07 12:25:31,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret5 := main(); {6012#true} is VALID [2022-04-07 12:25:31,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {6012#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6047#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {6047#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6047#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {6047#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6047#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {6047#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {6057#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {6057#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,457 INFO L272 TraceCheckUtils]: 10: Hoare triple {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6012#true} is VALID [2022-04-07 12:25:31,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:31,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:31,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:31,458 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6012#true} {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {6061#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {6089#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {6089#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,471 INFO L272 TraceCheckUtils]: 20: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6012#true} is VALID [2022-04-07 12:25:31,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:31,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:31,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:31,472 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6012#true} {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {6093#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {6127#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {6127#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6131#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-07 12:25:31,487 INFO L272 TraceCheckUtils]: 32: Hoare triple {6131#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:25:31,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {6135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:25:31,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {6139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6013#false} is VALID [2022-04-07 12:25:31,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2022-04-07 12:25:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:25:31,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:25:31,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {6013#false} assume !false; {6013#false} is VALID [2022-04-07 12:25:31,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {6139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6013#false} is VALID [2022-04-07 12:25:31,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {6135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:25:31,780 INFO L272 TraceCheckUtils]: 32: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:25:31,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {6159#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {6159#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:25:31,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,787 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6012#true} {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:31,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:31,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:31,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:31,787 INFO L272 TraceCheckUtils]: 20: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6012#true} is VALID [2022-04-07 12:25:31,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {6159#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,912 WARN L290 TraceCheckUtils]: 18: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {6159#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:25:33,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,914 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6012#true} {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:33,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {6012#true} assume !(0 == ~cond); {6012#true} is VALID [2022-04-07 12:25:33,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {6012#true} ~cond := #in~cond; {6012#true} is VALID [2022-04-07 12:25:33,915 INFO L272 TraceCheckUtils]: 10: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6012#true} is VALID [2022-04-07 12:25:33,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {6159#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {6159#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:25:33,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {6012#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6155#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:25:33,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {6012#true} call #t~ret5 := main(); {6012#true} is VALID [2022-04-07 12:25:33,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6012#true} {6012#true} #86#return; {6012#true} is VALID [2022-04-07 12:25:33,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {6012#true} assume true; {6012#true} is VALID [2022-04-07 12:25:33,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {6012#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; {6012#true} is VALID [2022-04-07 12:25:33,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {6012#true} call ULTIMATE.init(); {6012#true} is VALID [2022-04-07 12:25:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 12:25:33,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567015004] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:25:33,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:25:33,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-07 12:25:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755306531] [2022-04-07 12:25:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:25:33,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-07 12:25:33,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:33,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:36,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:36,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:25:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:25:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:25:36,192 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:38,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:40,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:42,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:44,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:46,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:48,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:51,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:53,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:55,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:57,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:59,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:01,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:03,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:06,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:08,372 INFO L93 Difference]: Finished difference Result 168 states and 232 transitions. [2022-04-07 12:26:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:26:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-07 12:26:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:26:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:26:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:26:08,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:26:10,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:26:10,570 INFO L225 Difference]: With dead ends: 168 [2022-04-07 12:26:10,570 INFO L226 Difference]: Without dead ends: 166 [2022-04-07 12:26:10,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:26:10,571 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:26:10,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 14 Unknown, 0 Unchecked, 29.6s Time] [2022-04-07 12:26:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-07 12:26:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-04-07 12:26:10,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:26:10,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 165 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:26:10,611 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 165 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:26:10,611 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 165 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:26:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:10,613 INFO L93 Difference]: Finished difference Result 166 states and 230 transitions. [2022-04-07 12:26:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2022-04-07 12:26:10,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:26:10,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:26:10,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 166 states. [2022-04-07 12:26:10,614 INFO L87 Difference]: Start difference. First operand has 165 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 166 states. [2022-04-07 12:26:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:10,616 INFO L93 Difference]: Finished difference Result 166 states and 230 transitions. [2022-04-07 12:26:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2022-04-07 12:26:10,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:26:10,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:26:10,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:26:10,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:26:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 12:26:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2022-04-07 12:26:10,619 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 36 [2022-04-07 12:26:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:26:10,619 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2022-04-07 12:26:10,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2022-04-07 12:26:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 12:26:10,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:26:10,620 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:26:10,642 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-07 12:26:10,828 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,SelfDestructingSolverStorable11 [2022-04-07 12:26:10,829 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:26:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:26:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1614274432, now seen corresponding path program 1 times [2022-04-07 12:26:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:26:10,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217492962] [2022-04-07 12:26:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:26:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:26:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:26:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:11,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {7028#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:11,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:11,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {7010#true} #86#return; {7015#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:26:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:11,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:11,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:11,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7010#true} {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} #84#return; {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-07 12:26:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:11,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:11,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:11,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7010#true} {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:26:11,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {7010#true} call ULTIMATE.init(); {7028#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:26:11,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {7028#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:11,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:11,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7029#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {7010#true} #86#return; {7015#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:11,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {7015#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {7015#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:11,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {7015#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7016#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:11,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {7016#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7017#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:26:11,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {7017#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7017#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:26:11,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {7017#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {7017#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:26:11,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {7017#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,098 INFO L272 TraceCheckUtils]: 10: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7010#true} is VALID [2022-04-07 12:26:11,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:11,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:11,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,099 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7010#true} {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} #84#return; {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:26:11,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {7018#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} ~l~0 := 1 + ~l~0; {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:26:11,103 INFO L272 TraceCheckUtils]: 23: Hoare triple {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7010#true} is VALID [2022-04-07 12:26:11,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:11,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:11,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,104 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7010#true} {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:26:11,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:26:11,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:26:11,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {7023#(and (<= 2 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {7011#false} is VALID [2022-04-07 12:26:11,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {7011#false} ~l~0 := 1 + ~l~0; {7011#false} is VALID [2022-04-07 12:26:11,107 INFO L272 TraceCheckUtils]: 32: Hoare triple {7011#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7011#false} is VALID [2022-04-07 12:26:11,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {7011#false} ~cond := #in~cond; {7011#false} is VALID [2022-04-07 12:26:11,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {7011#false} assume 0 == ~cond; {7011#false} is VALID [2022-04-07 12:26:11,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {7011#false} assume !false; {7011#false} is VALID [2022-04-07 12:26:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:26:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:26:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217492962] [2022-04-07 12:26:11,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217492962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:26:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610335980] [2022-04-07 12:26:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:26:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:26:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:26:11,109 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-07 12:26:11,110 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-07 12:26:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:11,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:26:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:11,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:26:11,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {7010#true} call ULTIMATE.init(); {7010#true} is VALID [2022-04-07 12:26:11,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#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; {7010#true} is VALID [2022-04-07 12:26:11,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7010#true} {7010#true} #86#return; {7010#true} is VALID [2022-04-07 12:26:11,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {7010#true} call #t~ret5 := main(); {7010#true} is VALID [2022-04-07 12:26:11,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {7010#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7048#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {7048#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7048#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {7048#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7048#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {7048#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {7058#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {7058#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,861 INFO L272 TraceCheckUtils]: 10: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7010#true} is VALID [2022-04-07 12:26:11,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:11,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:11,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,862 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7010#true} {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {7062#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {7099#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {7099#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,865 INFO L272 TraceCheckUtils]: 23: Hoare triple {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7010#true} is VALID [2022-04-07 12:26:11,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:11,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:11,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:11,866 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7010#true} {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {7103#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {7128#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {7128#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7132#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:11,868 INFO L272 TraceCheckUtils]: 32: Hoare triple {7132#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:26:11,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:26:11,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {7140#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7011#false} is VALID [2022-04-07 12:26:11,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {7011#false} assume !false; {7011#false} is VALID [2022-04-07 12:26:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:26:11,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:26:12,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {7011#false} assume !false; {7011#false} is VALID [2022-04-07 12:26:12,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {7140#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7011#false} is VALID [2022-04-07 12:26:12,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:26:12,236 INFO L272 TraceCheckUtils]: 32: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:26:12,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {7160#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:14,340 WARN L290 TraceCheckUtils]: 30: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {7160#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:26:14,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:14,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:14,342 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7010#true} {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:14,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:14,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:14,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:14,342 INFO L272 TraceCheckUtils]: 23: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7010#true} is VALID [2022-04-07 12:26:14,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {7160#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,450 WARN L290 TraceCheckUtils]: 21: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {7160#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:26:16,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,453 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7010#true} {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:16,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {7010#true} assume !(0 == ~cond); {7010#true} is VALID [2022-04-07 12:26:16,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {7010#true} ~cond := #in~cond; {7010#true} is VALID [2022-04-07 12:26:16,453 INFO L272 TraceCheckUtils]: 10: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7010#true} is VALID [2022-04-07 12:26:16,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {7160#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {7160#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:26:16,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {7010#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7156#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:16,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {7010#true} call #t~ret5 := main(); {7010#true} is VALID [2022-04-07 12:26:16,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7010#true} {7010#true} #86#return; {7010#true} is VALID [2022-04-07 12:26:16,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {7010#true} assume true; {7010#true} is VALID [2022-04-07 12:26:16,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {7010#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; {7010#true} is VALID [2022-04-07 12:26:16,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {7010#true} call ULTIMATE.init(); {7010#true} is VALID [2022-04-07 12:26:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 12:26:16,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610335980] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:26:16,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:26:16,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-07 12:26:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029302774] [2022-04-07 12:26:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:26:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-07 12:26:16,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:26:16,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:20,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:26:20,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:26:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:26:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:26:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-04-07 12:26:20,733 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:22,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:25,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:27,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:29,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:31,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:33,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:35,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:37,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:40,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:26:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:40,319 INFO L93 Difference]: Finished difference Result 180 states and 249 transitions. [2022-04-07 12:26:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:26:40,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-07 12:26:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:26:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:26:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:26:40,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:26:44,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 49 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:26:44,632 INFO L225 Difference]: With dead ends: 180 [2022-04-07 12:26:44,632 INFO L226 Difference]: Without dead ends: 178 [2022-04-07 12:26:44,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:26:44,633 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-04-07 12:26:44,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 18.8s Time] [2022-04-07 12:26:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-07 12:26:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2022-04-07 12:26:44,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:26:44,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 153 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:26:44,670 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 153 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:26:44,671 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 153 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:26:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:44,673 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2022-04-07 12:26:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2022-04-07 12:26:44,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:26:44,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:26:44,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 178 states. [2022-04-07 12:26:44,674 INFO L87 Difference]: Start difference. First operand has 153 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 178 states. [2022-04-07 12:26:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:44,676 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2022-04-07 12:26:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2022-04-07 12:26:44,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:26:44,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:26:44,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:26:44,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:26:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:26:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 211 transitions. [2022-04-07 12:26:44,681 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 211 transitions. Word has length 36 [2022-04-07 12:26:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:26:44,681 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 211 transitions. [2022-04-07 12:26:44,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2022-04-07 12:26:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 12:26:44,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:26:44,682 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:26:44,709 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-07 12:26:44,895 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,SelfDestructingSolverStorable12 [2022-04-07 12:26:44,896 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:26:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:26:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1647373334, now seen corresponding path program 1 times [2022-04-07 12:26:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:26:44,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654093492] [2022-04-07 12:26:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:26:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:26:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:26:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:45,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {8053#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:45,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:45,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {8035#true} #86#return; {8040#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:26:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:45,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:45,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:45,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #84#return; {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-07 12:26:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-07 12:26:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:45,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:45,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:45,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8036#false} #84#return; {8036#false} is VALID [2022-04-07 12:26:45,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {8035#true} call ULTIMATE.init(); {8053#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:26:45,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {8053#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:45,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:26:45,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8054#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {8035#true} #86#return; {8040#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:45,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {8040#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {8040#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:45,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {8040#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8041#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:26:45,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {8041#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8042#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:26:45,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {8042#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8042#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:26:45,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {8042#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {8042#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:26:45,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {8042#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-07 12:26:45,116 INFO L272 TraceCheckUtils]: 10: Hoare triple {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8035#true} is VALID [2022-04-07 12:26:45,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:45,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:45,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,117 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8035#true} {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #84#return; {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-07 12:26:45,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {8043#(and (<= (+ main_~n~0 2127483648) (+ (* 2147483649 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8048#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-07 12:26:45,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {8048#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8048#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-07 12:26:45,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {8048#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8048#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {8048#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#false} ~l~0 := 1 + ~l~0; {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L272 TraceCheckUtils]: 20: Hoare triple {8036#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8035#true} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,121 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8035#true} {8036#false} #84#return; {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {8036#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {8036#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {8036#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {8036#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {8036#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {8036#false} is VALID [2022-04-07 12:26:45,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {8036#false} ~l~0 := 1 + ~l~0; {8036#false} is VALID [2022-04-07 12:26:45,122 INFO L272 TraceCheckUtils]: 33: Hoare triple {8036#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8036#false} is VALID [2022-04-07 12:26:45,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {8036#false} ~cond := #in~cond; {8036#false} is VALID [2022-04-07 12:26:45,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {8036#false} assume 0 == ~cond; {8036#false} is VALID [2022-04-07 12:26:45,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#false} assume !false; {8036#false} is VALID [2022-04-07 12:26:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 12:26:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:26:45,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654093492] [2022-04-07 12:26:45,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654093492] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:26:45,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253332868] [2022-04-07 12:26:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:26:45,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:26:45,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:26:45,123 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-07 12:26:45,124 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-07 12:26:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:45,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:26:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:45,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:26:45,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {8035#true} call ULTIMATE.init(); {8035#true} is VALID [2022-04-07 12:26:45,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#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; {8035#true} is VALID [2022-04-07 12:26:45,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8035#true} #86#return; {8035#true} is VALID [2022-04-07 12:26:45,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {8035#true} call #t~ret5 := main(); {8035#true} is VALID [2022-04-07 12:26:45,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {8035#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8073#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {8073#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8073#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {8073#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8073#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {8073#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {8083#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {8083#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,946 INFO L272 TraceCheckUtils]: 10: Hoare triple {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8035#true} is VALID [2022-04-07 12:26:45,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:45,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:45,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,947 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8035#true} {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {8087#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {8115#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,949 INFO L272 TraceCheckUtils]: 20: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8035#true} is VALID [2022-04-07 12:26:45,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:45,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:45,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:45,950 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8035#true} {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {8119#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {8156#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {8156#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8160#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:26:45,954 INFO L272 TraceCheckUtils]: 33: Hoare triple {8160#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8164#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:26:45,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {8164#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8168#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:26:45,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {8168#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8036#false} is VALID [2022-04-07 12:26:45,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#false} assume !false; {8036#false} is VALID [2022-04-07 12:26:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:26:45,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:26:46,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#false} assume !false; {8036#false} is VALID [2022-04-07 12:26:46,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {8168#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8036#false} is VALID [2022-04-07 12:26:46,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {8164#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8168#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:26:46,354 INFO L272 TraceCheckUtils]: 33: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8164#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:26:46,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {8188#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,465 WARN L290 TraceCheckUtils]: 31: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {8188#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:26:48,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,468 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8035#true} {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:48,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:48,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:48,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:48,469 INFO L272 TraceCheckUtils]: 20: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8035#true} is VALID [2022-04-07 12:26:48,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {8188#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,574 WARN L290 TraceCheckUtils]: 18: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {8188#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:26:50,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,576 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8035#true} {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:50,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {8035#true} assume !(0 == ~cond); {8035#true} is VALID [2022-04-07 12:26:50,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {8035#true} ~cond := #in~cond; {8035#true} is VALID [2022-04-07 12:26:50,577 INFO L272 TraceCheckUtils]: 10: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8035#true} is VALID [2022-04-07 12:26:50,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {8188#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {8188#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:26:50,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {8035#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8184#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:26:50,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {8035#true} call #t~ret5 := main(); {8035#true} is VALID [2022-04-07 12:26:50,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8035#true} {8035#true} #86#return; {8035#true} is VALID [2022-04-07 12:26:50,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {8035#true} assume true; {8035#true} is VALID [2022-04-07 12:26:50,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {8035#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; {8035#true} is VALID [2022-04-07 12:26:50,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {8035#true} call ULTIMATE.init(); {8035#true} is VALID [2022-04-07 12:26:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 12:26:50,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253332868] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:26:50,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:26:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-07 12:26:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965304482] [2022-04-07 12:26:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:26:50,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-07 12:26:50,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:26:50,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:54,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:26:54,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:26:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:26:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:26:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-07 12:26:54,907 INFO L87 Difference]: Start difference. First operand 153 states and 211 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:26:57,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:01,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:03,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:05,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:07,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:09,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:12,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:14,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:14,545 INFO L93 Difference]: Finished difference Result 168 states and 232 transitions. [2022-04-07 12:27:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:27:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-07 12:27:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:27:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:27:14,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:27:21,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 48 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:21,031 INFO L225 Difference]: With dead ends: 168 [2022-04-07 12:27:21,031 INFO L226 Difference]: Without dead ends: 166 [2022-04-07 12:27:21,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:27:21,032 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:21,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 8 Unknown, 0 Unchecked, 17.0s Time] [2022-04-07 12:27:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-07 12:27:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2022-04-07 12:27:21,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:21,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 131 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:27:21,085 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 131 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:27:21,085 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 131 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:27:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:21,087 INFO L93 Difference]: Finished difference Result 166 states and 230 transitions. [2022-04-07 12:27:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2022-04-07 12:27:21,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:21,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:21,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 166 states. [2022-04-07 12:27:21,088 INFO L87 Difference]: Start difference. First operand has 131 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 166 states. [2022-04-07 12:27:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:21,090 INFO L93 Difference]: Finished difference Result 166 states and 230 transitions. [2022-04-07 12:27:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2022-04-07 12:27:21,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:21,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:21,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:21,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 12:27:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2022-04-07 12:27:21,092 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 37 [2022-04-07 12:27:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:21,092 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2022-04-07 12:27:21,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2022-04-07 12:27:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 12:27:21,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:21,093 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:21,111 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-07 12:27:21,307 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,SelfDestructingSolverStorable13 [2022-04-07 12:27:21,307 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1832857340, now seen corresponding path program 1 times [2022-04-07 12:27:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:21,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168663889] [2022-04-07 12:27:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:21,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {9015#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8999#true} is VALID [2022-04-07 12:27:21,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:21,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8999#true} {8999#true} #86#return; {8999#true} is VALID [2022-04-07 12:27:21,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:27:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:21,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:21,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:21,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:21,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8999#true} {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 12:27:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:21,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:21,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:21,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:21,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8999#true} {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #84#return; {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {8999#true} call ULTIMATE.init(); {9015#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:21,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {9015#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8999#true} is VALID [2022-04-07 12:27:21,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:21,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8999#true} {8999#true} #86#return; {8999#true} is VALID [2022-04-07 12:27:21,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {8999#true} call #t~ret5 := main(); {8999#true} is VALID [2022-04-07 12:27:21,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {8999#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9004#(= main_~l~0 0)} is VALID [2022-04-07 12:27:21,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {9004#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9004#(= main_~l~0 0)} is VALID [2022-04-07 12:27:21,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {9004#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9004#(= main_~l~0 0)} is VALID [2022-04-07 12:27:21,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {9004#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {9004#(= main_~l~0 0)} is VALID [2022-04-07 12:27:21,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {9004#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,378 INFO L272 TraceCheckUtils]: 10: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8999#true} is VALID [2022-04-07 12:27:21,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:21,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:21,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:21,379 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8999#true} {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:21,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {9005#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,382 INFO L272 TraceCheckUtils]: 21: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8999#true} is VALID [2022-04-07 12:27:21,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:21,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:21,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:21,382 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8999#true} {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #84#return; {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 12:27:21,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {9010#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {9000#false} is VALID [2022-04-07 12:27:21,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {9000#false} ~l~0 := 1 + ~l~0; {9000#false} is VALID [2022-04-07 12:27:21,385 INFO L272 TraceCheckUtils]: 33: Hoare triple {9000#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9000#false} is VALID [2022-04-07 12:27:21,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {9000#false} ~cond := #in~cond; {9000#false} is VALID [2022-04-07 12:27:21,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {9000#false} assume 0 == ~cond; {9000#false} is VALID [2022-04-07 12:27:21,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {9000#false} assume !false; {9000#false} is VALID [2022-04-07 12:27:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:27:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:21,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168663889] [2022-04-07 12:27:21,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168663889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:21,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229048300] [2022-04-07 12:27:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:21,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:21,394 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-07 12:27:21,395 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-07 12:27:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:27:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:21,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:27:22,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {8999#true} call ULTIMATE.init(); {8999#true} is VALID [2022-04-07 12:27:22,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {8999#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; {8999#true} is VALID [2022-04-07 12:27:22,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:22,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8999#true} {8999#true} #86#return; {8999#true} is VALID [2022-04-07 12:27:22,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {8999#true} call #t~ret5 := main(); {8999#true} is VALID [2022-04-07 12:27:22,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {8999#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9034#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {9034#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9034#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {9034#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9034#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {9034#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {9044#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {9044#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,136 INFO L272 TraceCheckUtils]: 10: Hoare triple {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8999#true} is VALID [2022-04-07 12:27:22,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:22,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:22,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:22,137 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8999#true} {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:22,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {9048#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {9079#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {9079#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,140 INFO L272 TraceCheckUtils]: 21: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8999#true} is VALID [2022-04-07 12:27:22,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:22,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:22,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:22,140 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8999#true} {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} #84#return; {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {9083#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {9117#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:27:22,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {9117#(and (= main_~v5~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {9121#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-07 12:27:22,144 INFO L272 TraceCheckUtils]: 33: Hoare triple {9121#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:22,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {9125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:22,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {9129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9000#false} is VALID [2022-04-07 12:27:22,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {9000#false} assume !false; {9000#false} is VALID [2022-04-07 12:27:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:27:22,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:27:22,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {9000#false} assume !false; {9000#false} is VALID [2022-04-07 12:27:22,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {9129#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9000#false} is VALID [2022-04-07 12:27:22,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {9125#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:22,446 INFO L272 TraceCheckUtils]: 33: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:22,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {9149#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {9149#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:27:22,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,454 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8999#true} {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:22,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:22,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:22,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:22,454 INFO L272 TraceCheckUtils]: 21: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8999#true} is VALID [2022-04-07 12:27:22,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {9149#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,583 WARN L290 TraceCheckUtils]: 19: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {9149#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:27:24,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,586 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8999#true} {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:24,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {8999#true} assume !(0 == ~cond); {8999#true} is VALID [2022-04-07 12:27:24,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {8999#true} ~cond := #in~cond; {8999#true} is VALID [2022-04-07 12:27:24,587 INFO L272 TraceCheckUtils]: 10: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8999#true} is VALID [2022-04-07 12:27:24,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {9149#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {9149#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:27:24,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {8999#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9145#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:24,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {8999#true} call #t~ret5 := main(); {8999#true} is VALID [2022-04-07 12:27:24,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8999#true} {8999#true} #86#return; {8999#true} is VALID [2022-04-07 12:27:24,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {8999#true} assume true; {8999#true} is VALID [2022-04-07 12:27:24,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {8999#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; {8999#true} is VALID [2022-04-07 12:27:24,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {8999#true} call ULTIMATE.init(); {8999#true} is VALID [2022-04-07 12:27:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-07 12:27:24,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229048300] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:24,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:27:24,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-07 12:27:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66631125] [2022-04-07 12:27:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:27:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-07 12:27:24,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:24,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:26,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:26,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:27:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:27:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:27:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:27:26,809 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:28,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:31,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:33,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:35,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:37,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:39,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:41,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:43,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:46,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:48,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:52,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:27:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:52,723 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2022-04-07 12:27:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:27:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-07 12:27:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:27:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:27:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:27:52,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:27:54,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:27:54,987 INFO L225 Difference]: With dead ends: 146 [2022-04-07 12:27:54,987 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 12:27:54,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 12:27:54,988 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2022-04-07 12:27:54,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 11 Unknown, 0 Unchecked, 23.5s Time] [2022-04-07 12:27:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 12:27:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2022-04-07 12:27:55,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:27:55,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 143 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 117 states have internal predecessors, (173), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:27:55,024 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 143 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 117 states have internal predecessors, (173), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:27:55,024 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 143 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 117 states have internal predecessors, (173), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:27:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:55,026 INFO L93 Difference]: Finished difference Result 144 states and 200 transitions. [2022-04-07 12:27:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2022-04-07 12:27:55,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:55,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:55,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 117 states have internal predecessors, (173), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 144 states. [2022-04-07 12:27:55,026 INFO L87 Difference]: Start difference. First operand has 143 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 117 states have internal predecessors, (173), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 144 states. [2022-04-07 12:27:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:27:55,028 INFO L93 Difference]: Finished difference Result 144 states and 200 transitions. [2022-04-07 12:27:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2022-04-07 12:27:55,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:27:55,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:27:55,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:27:55,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:27:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 117 states have internal predecessors, (173), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 12:27:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 198 transitions. [2022-04-07 12:27:55,031 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 198 transitions. Word has length 37 [2022-04-07 12:27:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:27:55,031 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 198 transitions. [2022-04-07 12:27:55,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:27:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 198 transitions. [2022-04-07 12:27:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 12:27:55,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:27:55,033 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:27:55,065 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-07 12:27:55,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:55,247 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:27:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:27:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 582945322, now seen corresponding path program 1 times [2022-04-07 12:27:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:27:55,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721837244] [2022-04-07 12:27:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:27:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:27:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:55,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {9918#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {9903#true} is VALID [2022-04-07 12:27:55,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:55,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9903#true} {9903#true} #86#return; {9903#true} is VALID [2022-04-07 12:27:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:27:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:55,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:55,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:55,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:55,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9903#true} {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-07 12:27:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:55,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:55,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:55,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:55,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9903#true} {9904#false} #84#return; {9904#false} is VALID [2022-04-07 12:27:55,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {9903#true} call ULTIMATE.init(); {9918#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:27:55,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {9918#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {9903#true} is VALID [2022-04-07 12:27:55,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:55,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9903#true} {9903#true} #86#return; {9903#true} is VALID [2022-04-07 12:27:55,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {9903#true} call #t~ret5 := main(); {9903#true} is VALID [2022-04-07 12:27:55,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {9903#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9908#(= main_~l~0 0)} is VALID [2022-04-07 12:27:55,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {9908#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9908#(= main_~l~0 0)} is VALID [2022-04-07 12:27:55,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {9908#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9908#(= main_~l~0 0)} is VALID [2022-04-07 12:27:55,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {9908#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {9908#(= main_~l~0 0)} is VALID [2022-04-07 12:27:55,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {9908#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,327 INFO L272 TraceCheckUtils]: 10: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9903#true} is VALID [2022-04-07 12:27:55,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:55,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:55,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:55,328 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9903#true} {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #84#return; {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {9909#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {9904#false} ~l~0 := 1 + ~l~0; {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L272 TraceCheckUtils]: 24: Hoare triple {9904#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9903#true} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:55,331 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9903#true} {9904#false} #84#return; {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {9904#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {9904#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {9904#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {9904#false} ~l~0 := 1 + ~l~0; {9904#false} is VALID [2022-04-07 12:27:55,331 INFO L272 TraceCheckUtils]: 33: Hoare triple {9904#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9904#false} is VALID [2022-04-07 12:27:55,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {9904#false} ~cond := #in~cond; {9904#false} is VALID [2022-04-07 12:27:55,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {9904#false} assume 0 == ~cond; {9904#false} is VALID [2022-04-07 12:27:55,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {9904#false} assume !false; {9904#false} is VALID [2022-04-07 12:27:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 12:27:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:27:55,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721837244] [2022-04-07 12:27:55,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721837244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:55,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267531119] [2022-04-07 12:27:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:27:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:27:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:27:55,334 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-07 12:27:55,335 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-07 12:27:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:55,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:27:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:27:55,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:27:56,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {9903#true} call ULTIMATE.init(); {9903#true} is VALID [2022-04-07 12:27:56,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {9903#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; {9903#true} is VALID [2022-04-07 12:27:56,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:56,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9903#true} {9903#true} #86#return; {9903#true} is VALID [2022-04-07 12:27:56,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {9903#true} call #t~ret5 := main(); {9903#true} is VALID [2022-04-07 12:27:56,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {9903#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9937#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9937#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {9937#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9937#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {9937#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {9947#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {9947#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,073 INFO L272 TraceCheckUtils]: 10: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9903#true} is VALID [2022-04-07 12:27:56,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:56,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:56,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:56,074 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9903#true} {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {9951#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {9991#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {9991#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,078 INFO L272 TraceCheckUtils]: 24: Hoare triple {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9903#true} is VALID [2022-04-07 12:27:56,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:56,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:56,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:56,079 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9903#true} {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {9995#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {10020#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {10020#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10024#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:27:56,081 INFO L272 TraceCheckUtils]: 33: Hoare triple {10024#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:56,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:56,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {10032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9904#false} is VALID [2022-04-07 12:27:56,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {9904#false} assume !false; {9904#false} is VALID [2022-04-07 12:27:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:27:56,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:27:56,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {9904#false} assume !false; {9904#false} is VALID [2022-04-07 12:27:56,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {10032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9904#false} is VALID [2022-04-07 12:27:56,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:27:56,409 INFO L272 TraceCheckUtils]: 33: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:27:56,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {10052#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,531 WARN L290 TraceCheckUtils]: 31: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {10052#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:27:58,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,533 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9903#true} {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:58,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:58,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:58,533 INFO L272 TraceCheckUtils]: 24: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9903#true} is VALID [2022-04-07 12:27:58,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {10052#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {10052#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:27:58,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,635 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9903#true} {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:58,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {9903#true} assume !(0 == ~cond); {9903#true} is VALID [2022-04-07 12:27:58,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {9903#true} ~cond := #in~cond; {9903#true} is VALID [2022-04-07 12:27:58,635 INFO L272 TraceCheckUtils]: 10: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9903#true} is VALID [2022-04-07 12:27:58,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {10052#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {10052#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:27:58,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {9903#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10048#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:27:58,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {9903#true} call #t~ret5 := main(); {9903#true} is VALID [2022-04-07 12:27:58,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9903#true} {9903#true} #86#return; {9903#true} is VALID [2022-04-07 12:27:58,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {9903#true} assume true; {9903#true} is VALID [2022-04-07 12:27:58,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {9903#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; {9903#true} is VALID [2022-04-07 12:27:58,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {9903#true} call ULTIMATE.init(); {9903#true} is VALID [2022-04-07 12:27:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 12:27:58,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267531119] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:27:58,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:27:58,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-07 12:27:58,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270017047] [2022-04-07 12:27:58,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:27:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-07 12:27:58,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:27:58,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:00,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:28:00,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:28:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:28:00,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:28:00,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:28:00,876 INFO L87 Difference]: Start difference. First operand 143 states and 198 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:03,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:07,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:09,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:11,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:13,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:15,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:18,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:20,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:22,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:24,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:28:24,840 INFO L93 Difference]: Finished difference Result 172 states and 240 transitions. [2022-04-07 12:28:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:28:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-07 12:28:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:28:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:28:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:28:24,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-07 12:28:27,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:28:27,170 INFO L225 Difference]: With dead ends: 172 [2022-04-07 12:28:27,170 INFO L226 Difference]: Without dead ends: 170 [2022-04-07 12:28:27,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:28:27,171 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-07 12:28:27,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 20.9s Time] [2022-04-07 12:28:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-07 12:28:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2022-04-07 12:28:27,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:28:27,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 155 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:28:27,214 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 155 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:28:27,214 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 155 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:28:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:28:27,216 INFO L93 Difference]: Finished difference Result 170 states and 238 transitions. [2022-04-07 12:28:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 238 transitions. [2022-04-07 12:28:27,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:28:27,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:28:27,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 170 states. [2022-04-07 12:28:27,217 INFO L87 Difference]: Start difference. First operand has 155 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 170 states. [2022-04-07 12:28:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:28:27,220 INFO L93 Difference]: Finished difference Result 170 states and 238 transitions. [2022-04-07 12:28:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 238 transitions. [2022-04-07 12:28:27,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:28:27,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:28:27,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:28:27,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:28:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 12:28:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2022-04-07 12:28:27,223 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 215 transitions. Word has length 37 [2022-04-07 12:28:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:28:27,224 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 215 transitions. [2022-04-07 12:28:27,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 215 transitions. [2022-04-07 12:28:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 12:28:27,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:28:27,224 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:28:27,243 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-07 12:28:27,441 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,SelfDestructingSolverStorable15 [2022-04-07 12:28:27,441 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:28:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:28:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1168540410, now seen corresponding path program 1 times [2022-04-07 12:28:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:28:27,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043208733] [2022-04-07 12:28:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:28:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:28:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:28:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:27,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {10923#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:28:27,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:28:27,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {10905#true} #86#return; {10910#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:28:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:28:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:27,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:27,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:27,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:27,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10905#true} {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #84#return; {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-07 12:28:27,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-07 12:28:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:27,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:27,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:27,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:27,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10905#true} {10906#false} #84#return; {10906#false} is VALID [2022-04-07 12:28:27,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {10905#true} call ULTIMATE.init(); {10923#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:28:27,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {10923#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:28:27,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:28:27,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10924#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {10905#true} #86#return; {10910#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:28:27,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {10910#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {10910#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:28:27,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {10910#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10911#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:28:27,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {10911#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10912#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:28:27,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {10912#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10912#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:28:27,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {10912#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {10912#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:28:27,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {10912#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-07 12:28:27,697 INFO L272 TraceCheckUtils]: 10: Hoare triple {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10905#true} is VALID [2022-04-07 12:28:27,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:27,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:27,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:27,698 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10905#true} {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #84#return; {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-07 12:28:27,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {10913#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10918#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-07 12:28:27,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {10918#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10918#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-07 12:28:27,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {10918#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10918#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-07 12:28:27,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {10918#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {10906#false} is VALID [2022-04-07 12:28:27,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {10906#false} ~l~0 := 1 + ~l~0; {10906#false} is VALID [2022-04-07 12:28:27,702 INFO L272 TraceCheckUtils]: 20: Hoare triple {10906#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10905#true} is VALID [2022-04-07 12:28:27,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:27,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:27,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:27,703 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10905#true} {10906#false} #84#return; {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {10906#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {10906#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {10906#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {10906#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {10906#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {10906#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {10906#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {10906#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {10906#false} ~l~0 := 1 + ~l~0; {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L272 TraceCheckUtils]: 34: Hoare triple {10906#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {10906#false} ~cond := #in~cond; {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {10906#false} assume 0 == ~cond; {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {10906#false} assume !false; {10906#false} is VALID [2022-04-07 12:28:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 12:28:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:28:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043208733] [2022-04-07 12:28:27,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043208733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:28:27,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463624707] [2022-04-07 12:28:27,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:28:27,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:28:27,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:28:27,705 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-07 12:28:27,706 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-07 12:28:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:27,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:28:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:27,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:28:28,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {10905#true} call ULTIMATE.init(); {10905#true} is VALID [2022-04-07 12:28:28,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {10905#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; {10905#true} is VALID [2022-04-07 12:28:28,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:28,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10905#true} {10905#true} #86#return; {10905#true} is VALID [2022-04-07 12:28:28,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {10905#true} call #t~ret5 := main(); {10905#true} is VALID [2022-04-07 12:28:28,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {10905#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10943#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {10943#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10943#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {10943#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10943#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {10943#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {10953#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {10953#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,539 INFO L272 TraceCheckUtils]: 10: Hoare triple {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10905#true} is VALID [2022-04-07 12:28:28,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:28,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:28,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:28,540 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10905#true} {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {10957#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {10985#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {10985#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,543 INFO L272 TraceCheckUtils]: 20: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10905#true} is VALID [2022-04-07 12:28:28,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:28,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:28,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:28,544 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10905#true} {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {10989#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {11029#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {11029#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {11033#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:28,548 INFO L272 TraceCheckUtils]: 34: Hoare triple {11033#(and (= main_~v5~0 1) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:28:28,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {11037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:28:28,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {11041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10906#false} is VALID [2022-04-07 12:28:28,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {10906#false} assume !false; {10906#false} is VALID [2022-04-07 12:28:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:28:28,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:28:28,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {10906#false} assume !false; {10906#false} is VALID [2022-04-07 12:28:28,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {11041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10906#false} is VALID [2022-04-07 12:28:28,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {11037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:28:28,939 INFO L272 TraceCheckUtils]: 34: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:28:28,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {11061#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {11061#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:28:28,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,982 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {10905#true} {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:28,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:28,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:28,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:28,982 INFO L272 TraceCheckUtils]: 20: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10905#true} is VALID [2022-04-07 12:28:28,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {11061#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,096 WARN L290 TraceCheckUtils]: 18: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {11061#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:28:31,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,098 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10905#true} {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:31,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {10905#true} assume !(0 == ~cond); {10905#true} is VALID [2022-04-07 12:28:31,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {10905#true} ~cond := #in~cond; {10905#true} is VALID [2022-04-07 12:28:31,099 INFO L272 TraceCheckUtils]: 10: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10905#true} is VALID [2022-04-07 12:28:31,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {11061#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {11061#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:28:31,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {10905#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11057#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:31,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {10905#true} call #t~ret5 := main(); {10905#true} is VALID [2022-04-07 12:28:31,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10905#true} {10905#true} #86#return; {10905#true} is VALID [2022-04-07 12:28:31,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {10905#true} assume true; {10905#true} is VALID [2022-04-07 12:28:31,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {10905#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; {10905#true} is VALID [2022-04-07 12:28:31,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {10905#true} call ULTIMATE.init(); {10905#true} is VALID [2022-04-07 12:28:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 12:28:31,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463624707] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:28:31,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:28:31,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-07 12:28:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659133672] [2022-04-07 12:28:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:28:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-07 12:28:31,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:28:31,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:33,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:28:33,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:28:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:28:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:28:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-07 12:28:33,299 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:35,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:37,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:41,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:43,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:46,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:48,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:50,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:28:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:28:50,734 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2022-04-07 12:28:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:28:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-07 12:28:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:28:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:28:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:28:50,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-07 12:28:52,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:28:52,955 INFO L225 Difference]: With dead ends: 199 [2022-04-07 12:28:52,956 INFO L226 Difference]: Without dead ends: 197 [2022-04-07 12:28:52,956 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-07 12:28:52,956 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-04-07 12:28:52,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 7 Unknown, 0 Unchecked, 14.9s Time] [2022-04-07 12:28:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-07 12:28:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-04-07 12:28:53,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:28:53,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 163 states have internal predecessors, (245), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:28:53,011 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 163 states have internal predecessors, (245), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:28:53,011 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 163 states have internal predecessors, (245), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:28:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:28:53,014 INFO L93 Difference]: Finished difference Result 197 states and 278 transitions. [2022-04-07 12:28:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions. [2022-04-07 12:28:53,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:28:53,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:28:53,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 163 states have internal predecessors, (245), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 197 states. [2022-04-07 12:28:53,015 INFO L87 Difference]: Start difference. First operand has 197 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 163 states have internal predecessors, (245), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 197 states. [2022-04-07 12:28:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:28:53,018 INFO L93 Difference]: Finished difference Result 197 states and 278 transitions. [2022-04-07 12:28:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions. [2022-04-07 12:28:53,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:28:53,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:28:53,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:28:53,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:28:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 163 states have internal predecessors, (245), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 12:28:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 278 transitions. [2022-04-07 12:28:53,025 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 278 transitions. Word has length 38 [2022-04-07 12:28:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:28:53,026 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 278 transitions. [2022-04-07 12:28:53,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:28:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions. [2022-04-07 12:28:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 12:28:53,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:28:53,026 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:28:53,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 12:28:53,242 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,SelfDestructingSolverStorable16 [2022-04-07 12:28:53,242 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:28:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:28:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 512426161, now seen corresponding path program 1 times [2022-04-07 12:28:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:28:53,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292919093] [2022-04-07 12:28:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:28:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:28:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:53,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:28:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:53,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {12070#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {12055#true} is VALID [2022-04-07 12:28:53,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:53,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12055#true} {12055#true} #86#return; {12055#true} is VALID [2022-04-07 12:28:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:28:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:53,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:53,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:53,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:53,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#true} {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} #84#return; {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 12:28:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:53,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:53,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:53,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:53,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#true} {12056#false} #84#return; {12056#false} is VALID [2022-04-07 12:28:53,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {12055#true} call ULTIMATE.init(); {12070#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:28:53,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {12070#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {12055#true} is VALID [2022-04-07 12:28:53,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:53,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#true} {12055#true} #86#return; {12055#true} is VALID [2022-04-07 12:28:53,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {12055#true} call #t~ret5 := main(); {12055#true} is VALID [2022-04-07 12:28:53,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {12055#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12060#(= main_~l~0 0)} is VALID [2022-04-07 12:28:53,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {12060#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12060#(= main_~l~0 0)} is VALID [2022-04-07 12:28:53,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {12060#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12060#(= main_~l~0 0)} is VALID [2022-04-07 12:28:53,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {12060#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {12060#(= main_~l~0 0)} is VALID [2022-04-07 12:28:53,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {12060#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,355 INFO L272 TraceCheckUtils]: 10: Hoare triple {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12055#true} is VALID [2022-04-07 12:28:53,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:53,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:53,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:53,356 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12055#true} {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} #84#return; {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {12061#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {12056#false} ~l~0 := 1 + ~l~0; {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L272 TraceCheckUtils]: 21: Hoare triple {12056#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12055#true} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:53,360 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12055#true} {12056#false} #84#return; {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {12056#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {12056#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {12056#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {12056#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12056#false} is VALID [2022-04-07 12:28:53,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {12056#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {12056#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {12056#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {12056#false} ~l~0 := 1 + ~l~0; {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L272 TraceCheckUtils]: 34: Hoare triple {12056#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {12056#false} ~cond := #in~cond; {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {12056#false} assume 0 == ~cond; {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {12056#false} assume !false; {12056#false} is VALID [2022-04-07 12:28:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 12:28:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:28:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292919093] [2022-04-07 12:28:53,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292919093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:28:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958513614] [2022-04-07 12:28:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:28:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:28:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:28:53,362 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-07 12:28:53,363 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-07 12:28:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:53,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:28:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:28:53,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:28:54,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {12055#true} call ULTIMATE.init(); {12055#true} is VALID [2022-04-07 12:28:54,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {12055#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; {12055#true} is VALID [2022-04-07 12:28:54,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:54,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#true} {12055#true} #86#return; {12055#true} is VALID [2022-04-07 12:28:54,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {12055#true} call #t~ret5 := main(); {12055#true} is VALID [2022-04-07 12:28:54,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {12055#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12089#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {12089#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12089#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {12089#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12089#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {12089#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {12099#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {12099#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,233 INFO L272 TraceCheckUtils]: 10: Hoare triple {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12055#true} is VALID [2022-04-07 12:28:54,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:54,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:54,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:54,234 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12055#true} {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:28:54,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {12103#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {12134#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {12134#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,237 INFO L272 TraceCheckUtils]: 21: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12055#true} is VALID [2022-04-07 12:28:54,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:54,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:54,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:54,237 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12055#true} {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} #84#return; {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {12138#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {12175#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {12175#(and (= main_~v5~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {12179#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:28:54,242 INFO L272 TraceCheckUtils]: 34: Hoare triple {12179#(and (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:28:54,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {12183#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:28:54,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {12187#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12056#false} is VALID [2022-04-07 12:28:54,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {12056#false} assume !false; {12056#false} is VALID [2022-04-07 12:28:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:28:54,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:28:54,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {12056#false} assume !false; {12056#false} is VALID [2022-04-07 12:28:54,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {12187#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12056#false} is VALID [2022-04-07 12:28:54,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {12183#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:28:54,573 INFO L272 TraceCheckUtils]: 34: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:28:54,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {12207#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,684 WARN L290 TraceCheckUtils]: 32: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {12207#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:28:56,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,687 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12055#true} {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:56,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:56,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:56,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:56,688 INFO L272 TraceCheckUtils]: 21: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12055#true} is VALID [2022-04-07 12:28:56,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {12207#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,804 WARN L290 TraceCheckUtils]: 19: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {12207#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:28:58,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,806 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12055#true} {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:58,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {12055#true} assume !(0 == ~cond); {12055#true} is VALID [2022-04-07 12:28:58,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#true} ~cond := #in~cond; {12055#true} is VALID [2022-04-07 12:28:58,807 INFO L272 TraceCheckUtils]: 10: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12055#true} is VALID [2022-04-07 12:28:58,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {12207#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {12207#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:28:58,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {12055#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:28:58,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {12055#true} call #t~ret5 := main(); {12055#true} is VALID [2022-04-07 12:28:58,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12055#true} {12055#true} #86#return; {12055#true} is VALID [2022-04-07 12:28:58,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {12055#true} assume true; {12055#true} is VALID [2022-04-07 12:28:58,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {12055#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; {12055#true} is VALID [2022-04-07 12:28:58,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {12055#true} call ULTIMATE.init(); {12055#true} is VALID [2022-04-07 12:28:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-07 12:28:58,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958513614] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:28:58,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:28:58,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-07 12:28:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19452329] [2022-04-07 12:28:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:28:58,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-07 12:28:58,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:28:58,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:03,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:29:03,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:29:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:29:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:29:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:29:03,134 INFO L87 Difference]: Start difference. First operand 197 states and 278 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:05,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:07,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:09,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:11,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:13,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:15,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:18,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:29:18,531 INFO L93 Difference]: Finished difference Result 225 states and 318 transitions. [2022-04-07 12:29:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:29:18,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-07 12:29:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:29:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:29:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-07 12:29:18,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-07 12:29:22,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 49 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:29:22,854 INFO L225 Difference]: With dead ends: 225 [2022-04-07 12:29:22,854 INFO L226 Difference]: Without dead ends: 223 [2022-04-07 12:29:22,855 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:29:22,855 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:29:22,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 15.0s Time] [2022-04-07 12:29:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-07 12:29:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2022-04-07 12:29:22,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:29:22,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 211 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 175 states have internal predecessors, (264), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:22,912 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 211 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 175 states have internal predecessors, (264), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:22,912 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 211 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 175 states have internal predecessors, (264), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:29:22,916 INFO L93 Difference]: Finished difference Result 223 states and 316 transitions. [2022-04-07 12:29:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2022-04-07 12:29:22,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:29:22,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:29:22,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 175 states have internal predecessors, (264), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 223 states. [2022-04-07 12:29:22,917 INFO L87 Difference]: Start difference. First operand has 211 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 175 states have internal predecessors, (264), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 223 states. [2022-04-07 12:29:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:29:22,920 INFO L93 Difference]: Finished difference Result 223 states and 316 transitions. [2022-04-07 12:29:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2022-04-07 12:29:22,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:29:22,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:29:22,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:29:22,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:29:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 175 states have (on average 1.5085714285714287) internal successors, (264), 175 states have internal predecessors, (264), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2022-04-07 12:29:22,924 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 38 [2022-04-07 12:29:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:29:22,925 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2022-04-07 12:29:22,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2022-04-07 12:29:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 12:29:22,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:29:22,925 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:29:22,944 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-07 12:29:23,139 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,SelfDestructingSolverStorable17 [2022-04-07 12:29:23,139 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:29:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:29:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash 344916415, now seen corresponding path program 1 times [2022-04-07 12:29:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:29:23,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419060807] [2022-04-07 12:29:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:29:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:29:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:23,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:29:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:23,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {13317#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {13302#true} is VALID [2022-04-07 12:29:23,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:23,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13302#true} {13302#true} #86#return; {13302#true} is VALID [2022-04-07 12:29:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:29:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:23,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:23,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:23,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:23,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} #84#return; {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 12:29:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:23,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:23,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:23,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:23,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13303#false} #84#return; {13303#false} is VALID [2022-04-07 12:29:23,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13317#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:29:23,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {13317#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {13302#true} is VALID [2022-04-07 12:29:23,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:23,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #86#return; {13302#true} is VALID [2022-04-07 12:29:23,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret5 := main(); {13302#true} is VALID [2022-04-07 12:29:23,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13307#(= main_~l~0 0)} is VALID [2022-04-07 12:29:23,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {13307#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {13307#(= main_~l~0 0)} is VALID [2022-04-07 12:29:23,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {13307#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13307#(= main_~l~0 0)} is VALID [2022-04-07 12:29:23,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {13307#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {13307#(= main_~l~0 0)} is VALID [2022-04-07 12:29:23,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {13307#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,239 INFO L272 TraceCheckUtils]: 10: Hoare triple {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13302#true} is VALID [2022-04-07 12:29:23,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:23,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:23,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:23,240 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13302#true} {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} #84#return; {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 12:29:23,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {13308#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {13303#false} is VALID [2022-04-07 12:29:23,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {13303#false} ~l~0 := 1 + ~l~0; {13303#false} is VALID [2022-04-07 12:29:23,244 INFO L272 TraceCheckUtils]: 21: Hoare triple {13303#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13302#true} is VALID [2022-04-07 12:29:23,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:23,251 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13302#true} {13303#false} #84#return; {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {13303#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {13303#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {13303#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {13303#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {13303#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {13303#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {13303#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {13303#false} ~l~0 := 1 + ~l~0; {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L272 TraceCheckUtils]: 35: Hoare triple {13303#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-07 12:29:23,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-07 12:29:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 12:29:23,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:29:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419060807] [2022-04-07 12:29:23,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419060807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:29:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542131310] [2022-04-07 12:29:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:29:23,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:29:23,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:29:23,253 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-07 12:29:23,283 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-07 12:29:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:23,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 12:29:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:23,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:29:24,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-07 12:29:24,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#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; {13302#true} is VALID [2022-04-07 12:29:24,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:24,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #86#return; {13302#true} is VALID [2022-04-07 12:29:24,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret5 := main(); {13302#true} is VALID [2022-04-07 12:29:24,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13336#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {13336#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {13336#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {13336#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13336#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {13336#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {13346#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {13346#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,174 INFO L272 TraceCheckUtils]: 10: Hoare triple {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13302#true} is VALID [2022-04-07 12:29:24,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:24,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:24,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:24,174 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13302#true} {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 12:29:24,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {13350#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {13381#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {13381#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,178 INFO L272 TraceCheckUtils]: 21: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13302#true} is VALID [2022-04-07 12:29:24,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:24,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:24,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:24,179 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13302#true} {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} #84#return; {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {13385#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {13425#(and (= main_~j~0 1) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {13425#(and (= main_~j~0 1) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {13429#(and (= main_~j~0 1) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 12:29:24,184 INFO L272 TraceCheckUtils]: 35: Hoare triple {13429#(and (= main_~j~0 1) (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:29:24,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {13433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:29:24,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {13437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13303#false} is VALID [2022-04-07 12:29:24,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-07 12:29:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:29:24,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:29:24,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-07 12:29:24,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {13437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13303#false} is VALID [2022-04-07 12:29:24,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {13433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:29:24,513 INFO L272 TraceCheckUtils]: 35: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:29:24,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {13457#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {13457#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:29:24,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,533 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13302#true} {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:24,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:24,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:24,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:24,533 INFO L272 TraceCheckUtils]: 21: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13302#true} is VALID [2022-04-07 12:29:24,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {13457#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,648 WARN L290 TraceCheckUtils]: 19: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {13457#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 12:29:26,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,650 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13302#true} {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:26,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {13302#true} assume !(0 == ~cond); {13302#true} is VALID [2022-04-07 12:29:26,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {13302#true} ~cond := #in~cond; {13302#true} is VALID [2022-04-07 12:29:26,650 INFO L272 TraceCheckUtils]: 10: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13302#true} is VALID [2022-04-07 12:29:26,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {13457#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {13457#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 12:29:26,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13453#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 12:29:26,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret5 := main(); {13302#true} is VALID [2022-04-07 12:29:26,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #86#return; {13302#true} is VALID [2022-04-07 12:29:26,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-07 12:29:26,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#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; {13302#true} is VALID [2022-04-07 12:29:26,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-07 12:29:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-07 12:29:26,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542131310] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:29:26,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:29:26,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-07 12:29:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216490126] [2022-04-07 12:29:26,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:29:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-07 12:29:26,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:29:26,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:28,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:29:28,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:29:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:29:28,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:29:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:29:28,896 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:31,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:33,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:35,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:37,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:39,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:41,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:43,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:48,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:29:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:29:48,682 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2022-04-07 12:29:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:29:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-07 12:29:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:29:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:29:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-07 12:29:48,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-07 12:29:53,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 51 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:29:53,067 INFO L225 Difference]: With dead ends: 227 [2022-04-07 12:29:53,067 INFO L226 Difference]: Without dead ends: 225 [2022-04-07 12:29:53,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:29:53,068 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:29:53,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 17.4s Time] [2022-04-07 12:29:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-07 12:29:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2022-04-07 12:29:53,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:29:53,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 212 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:53,123 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 212 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:53,123 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 212 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:29:53,126 INFO L93 Difference]: Finished difference Result 225 states and 320 transitions. [2022-04-07 12:29:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2022-04-07 12:29:53,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:29:53,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:29:53,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 225 states. [2022-04-07 12:29:53,127 INFO L87 Difference]: Start difference. First operand has 212 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 225 states. [2022-04-07 12:29:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:29:53,130 INFO L93 Difference]: Finished difference Result 225 states and 320 transitions. [2022-04-07 12:29:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 320 transitions. [2022-04-07 12:29:53,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:29:53,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:29:53,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:29:53,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:29:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 12:29:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2022-04-07 12:29:53,134 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 39 [2022-04-07 12:29:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:29:53,135 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2022-04-07 12:29:53,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:29:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2022-04-07 12:29:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 12:29:53,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:29:53,135 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:29:53,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-07 12:29:53,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:29:53,343 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:29:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:29:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1955359922, now seen corresponding path program 1 times [2022-04-07 12:29:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:29:53,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958025549] [2022-04-07 12:29:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:29:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:29:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:29:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:53,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {14585#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:29:53,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:29:53,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {14562#true} #86#return; {14567#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:29:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-07 12:29:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:53,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#true} ~cond := #in~cond; {14562#true} is VALID [2022-04-07 12:29:53,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume !(0 == ~cond); {14562#true} is VALID [2022-04-07 12:29:53,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-04-07 12:29:53,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14562#true} {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} #84#return; {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-07 12:29:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:53,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#true} ~cond := #in~cond; {14562#true} is VALID [2022-04-07 12:29:53,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume !(0 == ~cond); {14562#true} is VALID [2022-04-07 12:29:53,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-04-07 12:29:53,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14562#true} {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} #84#return; {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-07 12:29:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:29:53,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {14562#true} ~cond := #in~cond; {14562#true} is VALID [2022-04-07 12:29:53,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {14562#true} assume !(0 == ~cond); {14562#true} is VALID [2022-04-07 12:29:53,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-04-07 12:29:53,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14562#true} {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:29:53,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {14562#true} call ULTIMATE.init(); {14585#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:29:53,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {14585#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:29:53,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:29:53,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14586#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {14562#true} #86#return; {14567#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:29:53,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {14567#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {14567#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:29:53,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {14567#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {14568#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:29:53,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {14568#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {14569#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:29:53,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {14569#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {14569#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:29:53,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {14569#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {14569#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 12:29:53,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {14569#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,660 INFO L272 TraceCheckUtils]: 10: Hoare triple {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {14562#true} is VALID [2022-04-07 12:29:53,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {14562#true} ~cond := #in~cond; {14562#true} is VALID [2022-04-07 12:29:53,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {14562#true} assume !(0 == ~cond); {14562#true} is VALID [2022-04-07 12:29:53,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-04-07 12:29:53,660 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14562#true} {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} #84#return; {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} is VALID [2022-04-07 12:29:53,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {14570#(and (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 8609934592)) (<= 1 main_~l~0))} ~l~0 := 1 + ~l~0; {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,663 INFO L272 TraceCheckUtils]: 20: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {14562#true} is VALID [2022-04-07 12:29:53,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {14562#true} ~cond := #in~cond; {14562#true} is VALID [2022-04-07 12:29:53,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {14562#true} assume !(0 == ~cond); {14562#true} is VALID [2022-04-07 12:29:53,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-04-07 12:29:53,664 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14562#true} {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} #84#return; {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} is VALID [2022-04-07 12:29:53,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {14575#(and (<= 2 main_~l~0) (<= (+ main_~n~0 (* main_~l~0 8589934591)) (+ (* (div main_~n~0 4294967296) 4294967296) 17199869183)))} ~l~0 := 1 + ~l~0; {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:29:53,667 INFO L272 TraceCheckUtils]: 31: Hoare triple {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {14562#true} is VALID [2022-04-07 12:29:53,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {14562#true} ~cond := #in~cond; {14562#true} is VALID [2022-04-07 12:29:53,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {14562#true} assume !(0 == ~cond); {14562#true} is VALID [2022-04-07 12:29:53,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {14562#true} assume true; {14562#true} is VALID [2022-04-07 12:29:53,668 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14562#true} {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} #84#return; {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:29:53,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:29:53,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} is VALID [2022-04-07 12:29:53,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {14580#(and (<= 3 main_~l~0) (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {14563#false} is VALID [2022-04-07 12:29:53,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {14563#false} ~l~0 := 1 + ~l~0; {14563#false} is VALID [2022-04-07 12:29:53,671 INFO L272 TraceCheckUtils]: 40: Hoare triple {14563#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {14563#false} is VALID [2022-04-07 12:29:53,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {14563#false} ~cond := #in~cond; {14563#false} is VALID [2022-04-07 12:29:53,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {14563#false} assume 0 == ~cond; {14563#false} is VALID [2022-04-07 12:29:53,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {14563#false} assume !false; {14563#false} is VALID [2022-04-07 12:29:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 12:29:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:29:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958025549] [2022-04-07 12:29:53,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958025549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:29:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957727819] [2022-04-07 12:29:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:29:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:29:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:29:53,675 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-07 12:29:53,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process