/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/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:30:23,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:30:23,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:30:23,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:30:23,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:30:23,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:30:23,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:30:23,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:30:23,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:30:23,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:30:23,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:30:23,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:30:23,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:30:23,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:30:23,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:30:23,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:30:23,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:30:23,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:30:23,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:30:23,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:30:23,575 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:30:23,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:30:23,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:30:23,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:30:23,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:30:23,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:30:23,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:30:23,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:30:23,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:30:23,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:30:23,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:30:23,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:30:23,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:30:23,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:30:23,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:30:23,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:30:23,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:30:23,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:30:23,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:30:23,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:30:23,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:30:23,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:30:23,590 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-14 14:30:23,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:30:23,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:30:23,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:30:23,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:30:23,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:30:23,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:30:23,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:30:23,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:30:23,613 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:30:23,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:30:23,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:30:23,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:30:23,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:30:23,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:30:23,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:30:23,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:30:23,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:30:23,616 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:30:23,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:30:23,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:30:23,617 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-14 14:30:23,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:30:23,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:30:23,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:30:23,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:30:23,808 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:30:23,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-14 14:30:23,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b9618c/f3c83d9014864e1e84dad691431089bc/FLAG44b585ad1 [2022-04-14 14:30:24,209 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:30:24,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2022-04-14 14:30:24,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b9618c/f3c83d9014864e1e84dad691431089bc/FLAG44b585ad1 [2022-04-14 14:30:24,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131b9618c/f3c83d9014864e1e84dad691431089bc [2022-04-14 14:30:24,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:30:24,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:30:24,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:30:24,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:30:24,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:30:24,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4a0c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24, skipping insertion in model container [2022-04-14 14:30:24,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:30:24,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:30:24,761 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/sumt7.c[403,416] [2022-04-14 14:30:24,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:30:24,777 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:30:24,784 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/sumt7.c[403,416] [2022-04-14 14:30:24,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:30:24,797 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:30:24,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24 WrapperNode [2022-04-14 14:30:24,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:30:24,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:30:24,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:30:24,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:30:24,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:30:24,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:30:24,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:30:24,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:30:24,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (1/1) ... [2022-04-14 14:30:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:30:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:30:24,852 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-14 14:30:24,857 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-14 14:30:24,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:30:24,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:30:24,884 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:30:24,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:30:24,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:30:24,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:30:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:30:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:30:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:30:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:30:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:30:24,931 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:30:24,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:30:33,744 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:30:33,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:30:33,749 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 14:30:33,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:30:33 BoogieIcfgContainer [2022-04-14 14:30:33,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:30:33,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:30:33,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:30:33,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:30:33,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:30:24" (1/3) ... [2022-04-14 14:30:33,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75307191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:30:33, skipping insertion in model container [2022-04-14 14:30:33,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:24" (2/3) ... [2022-04-14 14:30:33,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75307191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:30:33, skipping insertion in model container [2022-04-14 14:30:33,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:30:33" (3/3) ... [2022-04-14 14:30:33,765 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2022-04-14 14:30:33,768 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:30:33,768 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:30:33,797 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:30:33,802 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-14 14:30:33,803 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:30:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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-14 14:30:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 14:30:33,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:30:33,821 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:30:33,821 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:30:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:30:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1555439542, now seen corresponding path program 1 times [2022-04-14 14:30:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:30:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656304869] [2022-04-14 14:30:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:30:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:30:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:30:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:34,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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; {30#true} is VALID [2022-04-14 14:30:34,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-14 14:30:34,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-14 14:30:34,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {40#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:30:34,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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; {30#true} is VALID [2022-04-14 14:30:34,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-14 14:30:34,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #81#return; {30#true} is VALID [2022-04-14 14:30:34,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-14 14:30:34,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {35#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:34,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {35#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {35#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:34,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {35#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:34,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(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) (= 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; {36#(and (= main_~k~0 0) (= main_~v2~0 0) (<= 1 main_~v1~0) (= main_~j~0 0) (<= main_~v1~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:34,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~k~0 0) (= main_~v2~0 0) (<= 1 main_~v1~0) (= main_~j~0 0) (<= main_~v1~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {37#(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_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~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_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:34,388 INFO L272 TraceCheckUtils]: 10: Hoare triple {37#(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_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~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_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:30:34,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:30:34,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31#false} is VALID [2022-04-14 14:30:34,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-14 14:30:34,390 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-14 14:30:34,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:30:34,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656304869] [2022-04-14 14:30:34,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656304869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:30:34,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:30:34,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 14:30:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044547443] [2022-04-14 14:30:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:30:34,396 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-14 14:30:34,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:30:34,400 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-14 14:30:34,415 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-14 14:30:34,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 14:30:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:30:34,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 14:30:34,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-14 14:30:34,433 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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-14 14:30:36,659 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-14 14:30:43,225 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-14 14:30:47,544 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-14 14:30:51,925 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-14 14:30:54,101 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-14 14:30:56,260 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-14 14:30:58,422 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-14 14:31:02,791 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-14 14:31:04,969 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-14 14:31:07,126 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-14 14:31:09,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:09,631 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-04-14 14:31:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 14:31:09,631 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-14 14:31:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:31:09,632 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-14 14:31:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-14 14:31:09,637 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-14 14:31:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-14 14:31:09,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-14 14:31:09,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:09,739 INFO L225 Difference]: With dead ends: 63 [2022-04-14 14:31:09,740 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 14:31:09,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:31:09,746 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:31:09,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 11 Unknown, 0 Unchecked, 22.9s Time] [2022-04-14 14:31:09,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 14:31:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-14 14:31:09,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:31:09,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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-14 14:31:09,774 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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-14 14:31:09,775 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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-14 14:31:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:09,779 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 14:31:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 14:31:09,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:09,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:09,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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 32 states. [2022-04-14 14:31:09,782 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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 32 states. [2022-04-14 14:31:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:09,792 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 14:31:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 14:31:09,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:09,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:09,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:31:09,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:31:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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-14 14:31:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-14 14:31:09,795 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2022-04-14 14:31:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:31:09,796 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-14 14:31:09,797 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-14 14:31:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-14 14:31:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 14:31:09,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:31:09,798 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:31:09,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 14:31:09,798 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:31:09,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:31:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2040977129, now seen corresponding path program 1 times [2022-04-14 14:31:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:31:09,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992622459] [2022-04-14 14:31:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:31:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:31:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:10,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(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#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:10,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {245#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:10,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {245#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {236#true} #81#return; {241#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:10,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {244#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:31:10,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(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#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:10,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {245#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:10,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {236#true} #81#return; {241#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:10,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {241#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:10,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {242#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:10,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {243#(= main_~l~0 0)} is VALID [2022-04-14 14:31:10,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {243#(= main_~l~0 0)} is VALID [2022-04-14 14:31:10,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(= main_~l~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); {237#false} is VALID [2022-04-14 14:31:10,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#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;~v2~0 := 1 + ~v2~0; {237#false} is VALID [2022-04-14 14:31:10,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} ~l~0 := 1 + ~l~0; {237#false} is VALID [2022-04-14 14:31:10,095 INFO L272 TraceCheckUtils]: 11: Hoare triple {237#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {237#false} is VALID [2022-04-14 14:31:10,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-04-14 14:31:10,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-04-14 14:31:10,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-14 14:31:10,096 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-14 14:31:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:31:10,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992622459] [2022-04-14 14:31:10,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992622459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:31:10,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:31:10,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 14:31:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477938475] [2022-04-14 14:31:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:31:10,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:31:10,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:31:10,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:12,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:12,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 14:31:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:31:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 14:31:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 14:31:12,277 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:14,460 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-14 14:31:18,758 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-14 14:31:29,598 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-14 14:31:33,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-14 14:31:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:34,129 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-14 14:31:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:31:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:31:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:31:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-14 14:31:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-14 14:31:34,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-14 14:31:36,341 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-14 14:31:36,342 INFO L225 Difference]: With dead ends: 45 [2022-04-14 14:31:36,342 INFO L226 Difference]: Without dead ends: 30 [2022-04-14 14:31:36,342 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:31:36,343 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:31:36,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-14 14:31:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-14 14:31:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-14 14:31:36,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:31:36,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-14 14:31:36,364 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-14 14:31:36,364 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-14 14:31:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:36,365 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-14 14:31:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-14 14:31:36,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:36,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:36,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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 30 states. [2022-04-14 14:31:36,366 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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 30 states. [2022-04-14 14:31:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:36,367 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-14 14:31:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-14 14:31:36,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:36,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:36,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:31:36,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:31:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-14 14:31:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-14 14:31:36,369 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2022-04-14 14:31:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:31:36,369 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-14 14:31:36,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-14 14:31:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 14:31:36,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:31:36,370 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:31:36,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 14:31:36,370 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:31:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:31:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1572266990, now seen corresponding path program 1 times [2022-04-14 14:31:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:31:36,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715960822] [2022-04-14 14:31:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:31:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:31:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:36,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#(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; {410#true} is VALID [2022-04-14 14:31:36,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:36,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {410#true} {410#true} #81#return; {410#true} is VALID [2022-04-14 14:31:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:31:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:36,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#true} ~cond := #in~cond; {410#true} is VALID [2022-04-14 14:31:36,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume !(0 == ~cond); {410#true} is VALID [2022-04-14 14:31:36,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:36,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {410#true} {416#(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))} #79#return; {416#(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-14 14:31:36,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {410#true} call ULTIMATE.init(); {421#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:31:36,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(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; {410#true} is VALID [2022-04-14 14:31:36,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:36,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {410#true} {410#true} #81#return; {410#true} is VALID [2022-04-14 14:31:36,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {410#true} call #t~ret5 := main(); {410#true} is VALID [2022-04-14 14:31:36,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {415#(= main_~l~0 0)} is VALID [2022-04-14 14:31:36,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {415#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {415#(= main_~l~0 0)} is VALID [2022-04-14 14:31:36,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {415#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {415#(= main_~l~0 0)} is VALID [2022-04-14 14:31:36,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {415#(= main_~l~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; {415#(= main_~l~0 0)} is VALID [2022-04-14 14:31:36,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {416#(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-14 14:31:36,542 INFO L272 TraceCheckUtils]: 10: Hoare triple {416#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {410#true} is VALID [2022-04-14 14:31:36,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#true} ~cond := #in~cond; {410#true} is VALID [2022-04-14 14:31:36,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#true} assume !(0 == ~cond); {410#true} is VALID [2022-04-14 14:31:36,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:36,544 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {410#true} {416#(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))} #79#return; {416#(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-14 14:31:36,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(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); {416#(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-14 14:31:36,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {416#(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; {411#false} is VALID [2022-04-14 14:31:36,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#false} ~l~0 := 1 + ~l~0; {411#false} is VALID [2022-04-14 14:31:36,547 INFO L272 TraceCheckUtils]: 18: Hoare triple {411#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {411#false} is VALID [2022-04-14 14:31:36,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#false} ~cond := #in~cond; {411#false} is VALID [2022-04-14 14:31:36,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {411#false} assume 0 == ~cond; {411#false} is VALID [2022-04-14 14:31:36,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {411#false} assume !false; {411#false} is VALID [2022-04-14 14:31:36,548 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-14 14:31:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:31:36,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715960822] [2022-04-14 14:31:36,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715960822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:31:36,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420676403] [2022-04-14 14:31:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:31:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:31:36,550 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-14 14:31:36,567 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-14 14:31:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:36,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 14:31:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:36,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:31:37,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {410#true} call ULTIMATE.init(); {410#true} is VALID [2022-04-14 14:31:37,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#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; {410#true} is VALID [2022-04-14 14:31:37,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:37,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {410#true} {410#true} #81#return; {410#true} is VALID [2022-04-14 14:31:37,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {410#true} call #t~ret5 := main(); {410#true} is VALID [2022-04-14 14:31:37,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {440#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {440#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {440#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {440#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(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) (= 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; {450#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,143 INFO L272 TraceCheckUtils]: 10: Hoare triple {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {410#true} is VALID [2022-04-14 14:31:37,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#true} ~cond := #in~cond; {410#true} is VALID [2022-04-14 14:31:37,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#true} assume !(0 == ~cond); {410#true} is VALID [2022-04-14 14:31:37,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:37,144 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {410#true} {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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; {476#(and (= main_~k~0 0) (= 2 main_~v1~0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {476#(and (= main_~k~0 0) (= 2 main_~v1~0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {480#(and (= main_~l~0 2) (= main_~k~0 0) (= 2 main_~v1~0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:37,147 INFO L272 TraceCheckUtils]: 18: Hoare triple {480#(and (= main_~l~0 2) (= main_~k~0 0) (= 2 main_~v1~0) (= main_~v2~0 0) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {484#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:31:37,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {488#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:31:37,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {411#false} is VALID [2022-04-14 14:31:37,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {411#false} assume !false; {411#false} is VALID [2022-04-14 14:31:37,148 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-14 14:31:37,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:31:37,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {411#false} assume !false; {411#false} is VALID [2022-04-14 14:31:37,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {411#false} is VALID [2022-04-14 14:31:37,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {488#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:31:37,444 INFO L272 TraceCheckUtils]: 18: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {484#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:31:37,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:39,562 WARN L290 TraceCheckUtils]: 16: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {508#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:31:39,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:39,563 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {410#true} {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:39,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:39,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#true} assume !(0 == ~cond); {410#true} is VALID [2022-04-14 14:31:39,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#true} ~cond := #in~cond; {410#true} is VALID [2022-04-14 14:31:39,564 INFO L272 TraceCheckUtils]: 10: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {410#true} is VALID [2022-04-14 14:31:39,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:41,677 WARN L290 TraceCheckUtils]: 8: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {508#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:31:41,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:41,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:41,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {504#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:41,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {410#true} call #t~ret5 := main(); {410#true} is VALID [2022-04-14 14:31:41,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {410#true} {410#true} #81#return; {410#true} is VALID [2022-04-14 14:31:41,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} assume true; {410#true} is VALID [2022-04-14 14:31:41,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#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; {410#true} is VALID [2022-04-14 14:31:41,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {410#true} call ULTIMATE.init(); {410#true} is VALID [2022-04-14 14:31:41,683 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-14 14:31:41,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420676403] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:31:41,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:31:41,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:31:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028207927] [2022-04-14 14:31:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:31:41,684 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-14 14:31:41,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:31:41,687 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-14 14:31:43,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:43,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:31:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:31:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:31:43,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:31:43,827 INFO L87 Difference]: Start difference. First operand 30 states and 36 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-14 14:31:45,876 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-14 14:31:47,985 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-14 14:31:50,199 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-14 14:31:54,543 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-14 14:32:01,018 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-14 14:32:03,186 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-14 14:32:05,312 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-14 14:32:09,596 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-14 14:32:16,075 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-14 14:32:20,427 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-14 14:32:26,925 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-14 14:32:29,090 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-14 14:32:31,246 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-14 14:32:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:31,248 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-14 14:32:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:32:31,363 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-14 14:32:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:32:31,363 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-14 14:32:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:32:31,365 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-14 14:32:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:32:31,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-14 14:32:33,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:33,503 INFO L225 Difference]: With dead ends: 40 [2022-04-14 14:32:33,503 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 14:32:33,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 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-14 14:32:33,504 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2022-04-14 14:32:33,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 26.5s Time] [2022-04-14 14:32:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 14:32:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-14 14:32:33,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:32:33,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-14 14:32:33,522 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-14 14:32:33,522 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-14 14:32:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:33,523 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-14 14:32:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 14:32:33,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:33,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:33,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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 38 states. [2022-04-14 14:32:33,524 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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 38 states. [2022-04-14 14:32:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:33,525 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-14 14:32:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 14:32:33,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:33,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:33,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:32:33,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:32:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-14 14:32:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-14 14:32:33,527 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 22 [2022-04-14 14:32:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:32:33,527 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-14 14:32:33,527 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-14 14:32:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-14 14:32:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 14:32:33,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:32:33,529 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-14 14:32:33,545 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-14 14:32:33,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:33,745 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:32:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:32:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -428644851, now seen corresponding path program 1 times [2022-04-14 14:32:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:32:33,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778889431] [2022-04-14 14:32:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:32:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:32:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:33,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#(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; {736#true} is VALID [2022-04-14 14:32:33,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:33,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {736#true} {736#true} #81#return; {736#true} is VALID [2022-04-14 14:32:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:32:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:33,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {736#true} ~cond := #in~cond; {736#true} is VALID [2022-04-14 14:32:33,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} assume !(0 == ~cond); {736#true} is VALID [2022-04-14 14:32:33,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:33,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {742#(<= (+ (* 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)} #79#return; {742#(<= (+ (* 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-14 14:32:33,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {747#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:32:33,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#(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; {736#true} is VALID [2022-04-14 14:32:33,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:33,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #81#return; {736#true} is VALID [2022-04-14 14:32:33,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret5 := main(); {736#true} is VALID [2022-04-14 14:32:33,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {741#(= main_~l~0 0)} is VALID [2022-04-14 14:32:33,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {741#(= main_~l~0 0)} is VALID [2022-04-14 14:32:33,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {741#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {741#(= main_~l~0 0)} is VALID [2022-04-14 14:32:33,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= main_~l~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; {741#(= main_~l~0 0)} is VALID [2022-04-14 14:32:33,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {742#(<= (+ (* 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-14 14:32:33,832 INFO L272 TraceCheckUtils]: 10: Hoare triple {742#(<= (+ (* 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {736#true} is VALID [2022-04-14 14:32:33,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {736#true} ~cond := #in~cond; {736#true} is VALID [2022-04-14 14:32:33,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#true} assume !(0 == ~cond); {736#true} is VALID [2022-04-14 14:32:33,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:33,833 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {736#true} {742#(<= (+ (* 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)} #79#return; {742#(<= (+ (* 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-14 14:32:33,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {742#(<= (+ (* 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); {742#(<= (+ (* 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-14 14:32:33,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {742#(<= (+ (* 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); {742#(<= (+ (* 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-14 14:32:33,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {742#(<= (+ (* 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; {737#false} is VALID [2022-04-14 14:32:33,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {737#false} ~l~0 := 1 + ~l~0; {737#false} is VALID [2022-04-14 14:32:33,836 INFO L272 TraceCheckUtils]: 19: Hoare triple {737#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {737#false} is VALID [2022-04-14 14:32:33,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-14 14:32:33,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-14 14:32:33,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-14 14:32:33,836 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-14 14:32:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:32:33,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778889431] [2022-04-14 14:32:33,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778889431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:33,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080346159] [2022-04-14 14:32:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:33,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:33,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:32:33,839 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-14 14:32:33,843 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-14 14:32:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:33,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 14:32:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:33,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:32:34,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2022-04-14 14:32:34,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#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; {736#true} is VALID [2022-04-14 14:32:34,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:34,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #81#return; {736#true} is VALID [2022-04-14 14:32:34,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret5 := main(); {736#true} is VALID [2022-04-14 14:32:34,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {766#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {766#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {766#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {766#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {766#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {766#(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) (= 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; {776#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,309 INFO L272 TraceCheckUtils]: 10: Hoare triple {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {736#true} is VALID [2022-04-14 14:32:34,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {736#true} ~cond := #in~cond; {736#true} is VALID [2022-04-14 14:32:34,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#true} assume !(0 == ~cond); {736#true} is VALID [2022-04-14 14:32:34,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:34,310 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {736#true} {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {780#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {805#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {805#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {809#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:34,313 INFO L272 TraceCheckUtils]: 19: Hoare triple {809#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:34,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:34,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {737#false} is VALID [2022-04-14 14:32:34,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-14 14:32:34,314 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-14 14:32:34,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:32:34,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-14 14:32:34,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {817#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {737#false} is VALID [2022-04-14 14:32:34,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {813#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {817#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:34,531 INFO L272 TraceCheckUtils]: 19: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {813#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:34,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {837#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:36,640 WARN L290 TraceCheckUtils]: 17: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {837#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:32:36,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:36,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:36,642 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {736#true} {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:36,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:36,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#true} assume !(0 == ~cond); {736#true} is VALID [2022-04-14 14:32:36,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {736#true} ~cond := #in~cond; {736#true} is VALID [2022-04-14 14:32:36,643 INFO L272 TraceCheckUtils]: 10: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {736#true} is VALID [2022-04-14 14:32:36,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:38,757 WARN L290 TraceCheckUtils]: 8: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {837#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:32:38,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:38,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:38,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:38,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret5 := main(); {736#true} is VALID [2022-04-14 14:32:38,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #81#return; {736#true} is VALID [2022-04-14 14:32:38,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-14 14:32:38,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#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; {736#true} is VALID [2022-04-14 14:32:38,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2022-04-14 14:32:38,759 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-14 14:32:38,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080346159] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:38,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:32:38,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:32:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569162048] [2022-04-14 14:32:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:32:38,760 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-14 14:32:38,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:32:38,760 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-14 14:32:42,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:42,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:32:42,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:32:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:32:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:32:42,990 INFO L87 Difference]: Start difference. First operand 32 states and 39 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-14 14:32:45,133 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-14 14:32:47,295 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-14 14:32:49,453 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-14 14:32:51,565 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-14 14:32:55,846 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-14 14:33:02,341 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-14 14:33:06,698 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-14 14:33:13,207 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-14 14:33:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:13,416 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-14 14:33:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:33:13,417 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-14 14:33:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:33:13,417 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-14 14:33:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:33:13,418 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-14 14:33:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:33:13,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-14 14:33:17,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:17,680 INFO L225 Difference]: With dead ends: 43 [2022-04-14 14:33:17,680 INFO L226 Difference]: Without dead ends: 41 [2022-04-14 14:33:17,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 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-14 14:33:17,681 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:33:17,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 16.4s Time] [2022-04-14 14:33:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-14 14:33:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-04-14 14:33:17,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:33:17,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 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-14 14:33:17,707 INFO L74 IsIncluded]: Start isIncluded. First operand 41 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-14 14:33:17,707 INFO L87 Difference]: Start difference. First operand 41 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-14 14:33:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:17,708 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-14 14:33:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-14 14:33:17,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:17,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:17,709 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 41 states. [2022-04-14 14:33:17,709 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 41 states. [2022-04-14 14:33:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:17,711 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-14 14:33:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-14 14:33:17,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:17,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:17,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:33:17,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:33:17,712 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-14 14:33:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-14 14:33:17,712 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 23 [2022-04-14 14:33:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:33:17,713 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-14 14:33:17,713 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-14 14:33:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-14 14:33:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 14:33:17,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:33:17,723 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-14 14:33:17,745 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-14 14:33:17,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-14 14:33:17,935 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:33:17,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:33:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 807048845, now seen corresponding path program 1 times [2022-04-14 14:33:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:33:17,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052644732] [2022-04-14 14:33:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:33:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:33:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:18,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {1093#(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; {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:18,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:18,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1079#true} #81#return; {1084#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:33:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:18,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#true} ~cond := #in~cond; {1079#true} is VALID [2022-04-14 14:33:18,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#true} assume !(0 == ~cond); {1079#true} is VALID [2022-04-14 14:33:18,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-04-14 14:33:18,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#true} {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:18,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {1079#true} call ULTIMATE.init(); {1093#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:33:18,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#(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; {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:18,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:18,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1094#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1079#true} #81#return; {1084#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:18,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1084#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:18,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1085#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:18,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {1085#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1086#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:18,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {1086#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1086#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:18,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1086#(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 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {1086#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:18,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1086#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:18,242 INFO L272 TraceCheckUtils]: 10: Hoare triple {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1079#true} is VALID [2022-04-14 14:33:18,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {1079#true} ~cond := #in~cond; {1079#true} is VALID [2022-04-14 14:33:18,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#true} assume !(0 == ~cond); {1079#true} is VALID [2022-04-14 14:33:18,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-04-14 14:33:18,243 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1079#true} {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:18,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1087#(or (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)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1092#(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-14 14:33:18,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#(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); {1092#(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-14 14:33:18,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {1092#(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); {1092#(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-14 14:33:18,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(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; {1080#false} is VALID [2022-04-14 14:33:18,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1080#false} ~l~0 := 1 + ~l~0; {1080#false} is VALID [2022-04-14 14:33:18,250 INFO L272 TraceCheckUtils]: 20: Hoare triple {1080#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1080#false} is VALID [2022-04-14 14:33:18,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {1080#false} ~cond := #in~cond; {1080#false} is VALID [2022-04-14 14:33:18,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {1080#false} assume 0 == ~cond; {1080#false} is VALID [2022-04-14 14:33:18,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2022-04-14 14:33:18,250 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-14 14:33:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:33:18,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052644732] [2022-04-14 14:33:18,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052644732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:18,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357381863] [2022-04-14 14:33:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:18,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:18,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:33:18,253 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-14 14:33:18,254 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-14 14:33:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:18,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 14:33:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:18,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:33:18,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {1079#true} call ULTIMATE.init(); {1079#true} is VALID [2022-04-14 14:33:18,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#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; {1079#true} is VALID [2022-04-14 14:33:18,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-04-14 14:33:18,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#true} {1079#true} #81#return; {1079#true} is VALID [2022-04-14 14:33:18,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#true} call #t~ret5 := main(); {1079#true} is VALID [2022-04-14 14:33:18,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1113#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:18,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {1113#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1113#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:18,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1113#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:18,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#(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) (= 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; {1123#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:18,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {1123#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1127#(and (= 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-14 14:33:18,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {1127#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1079#true} is VALID [2022-04-14 14:33:18,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {1079#true} ~cond := #in~cond; {1079#true} is VALID [2022-04-14 14:33:18,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#true} assume !(0 == ~cond); {1079#true} is VALID [2022-04-14 14:33:18,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-04-14 14:33:18,795 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1079#true} {1127#(and (= 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))} #79#return; {1127#(and (= 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-14 14:33:18,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1127#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1127#(and (= 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-14 14:33:18,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {1127#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1127#(and (= 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-14 14:33:18,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1127#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1127#(and (= 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-14 14:33:18,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {1127#(and (= 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))} 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; {1155#(and (= 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 1))} is VALID [2022-04-14 14:33:18,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {1155#(and (= 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 1))} ~l~0 := 1 + ~l~0; {1159#(and (= 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 1))} is VALID [2022-04-14 14:33:18,799 INFO L272 TraceCheckUtils]: 20: Hoare triple {1159#(and (= 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 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:18,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1167#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:18,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {1167#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1080#false} is VALID [2022-04-14 14:33:18,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2022-04-14 14:33:18,800 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-14 14:33:18,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:33:19,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2022-04-14 14:33:19,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {1167#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1080#false} is VALID [2022-04-14 14:33:19,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1167#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:19,066 INFO L272 TraceCheckUtils]: 20: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:19,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {1187#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,184 WARN L290 TraceCheckUtils]: 18: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {1187#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:21,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,189 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1079#true} {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-04-14 14:33:21,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#true} assume !(0 == ~cond); {1079#true} is VALID [2022-04-14 14:33:21,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {1079#true} ~cond := #in~cond; {1079#true} is VALID [2022-04-14 14:33:21,190 INFO L272 TraceCheckUtils]: 10: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1079#true} is VALID [2022-04-14 14:33:21,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:23,306 WARN L290 TraceCheckUtils]: 8: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {1187#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:23,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:23,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:23,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1183#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:23,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#true} call #t~ret5 := main(); {1079#true} is VALID [2022-04-14 14:33:23,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#true} {1079#true} #81#return; {1079#true} is VALID [2022-04-14 14:33:23,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-04-14 14:33:23,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#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; {1079#true} is VALID [2022-04-14 14:33:23,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1079#true} call ULTIMATE.init(); {1079#true} is VALID [2022-04-14 14:33:23,308 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-14 14:33:23,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357381863] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:23,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:33:23,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 18 [2022-04-14 14:33:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646336070] [2022-04-14 14:33:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:33:23,308 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-14 14:33:23,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:33:23,309 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-14 14:33:27,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:27,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:33:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:33:27,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:33:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:33:27,594 INFO L87 Difference]: Start difference. First operand 33 states and 41 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-14 14:33:29,706 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-14 14:33:31,869 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-14 14:33:34,042 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-14 14:33:36,154 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-14 14:33:38,286 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-14 14:33:40,406 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-14 14:33:46,933 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-14 14:33:51,255 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-14 14:33:53,474 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-14 14:33:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:55,713 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-14 14:33:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:33:55,713 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-14 14:33:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:33:55,714 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-14 14:33:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-14 14:33:55,715 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-14 14:33:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-14 14:33:55,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-14 14:33:59,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:59,955 INFO L225 Difference]: With dead ends: 54 [2022-04-14 14:33:59,955 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 14:33:59,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:33:59,959 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:33:59,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 9 Unknown, 0 Unchecked, 18.9s Time] [2022-04-14 14:33:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 14:33:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-14 14:33:59,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:33:59,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-14 14:33:59,993 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-14 14:33:59,993 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-14 14:33:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:59,995 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-04-14 14:33:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-14 14:33:59,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:59,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:59,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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 52 states. [2022-04-14 14:33:59,995 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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 52 states. [2022-04-14 14:33:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:59,996 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-04-14 14:33:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-14 14:33:59,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:59,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:59,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:33:59,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:33:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-14 14:33:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-04-14 14:33:59,998 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 24 [2022-04-14 14:33:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:33:59,998 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-04-14 14:33:59,998 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-14 14:33:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-14 14:33:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 14:33:59,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:33:59,999 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-14 14:34:00,021 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-14 14:34:00,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:00,215 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:34:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:34:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 601993512, now seen corresponding path program 1 times [2022-04-14 14:34:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:34:00,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254669536] [2022-04-14 14:34:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:34:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:34:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:00,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {1504#(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; {1493#true} is VALID [2022-04-14 14:34:00,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:00,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} #81#return; {1493#true} is VALID [2022-04-14 14:34:00,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:34:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:00,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {1493#true} ~cond := #in~cond; {1493#true} is VALID [2022-04-14 14:34:00,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume !(0 == ~cond); {1493#true} is VALID [2022-04-14 14:34:00,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:00,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #79#return; {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:34:00,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#(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; {1493#true} is VALID [2022-04-14 14:34:00,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:00,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #81#return; {1493#true} is VALID [2022-04-14 14:34:00,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-14 14:34:00,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1498#(= main_~l~0 0)} is VALID [2022-04-14 14:34:00,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {1498#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1498#(= main_~l~0 0)} is VALID [2022-04-14 14:34:00,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {1498#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1498#(= main_~l~0 0)} is VALID [2022-04-14 14:34:00,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {1498#(= main_~l~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; {1498#(= main_~l~0 0)} is VALID [2022-04-14 14:34:00,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {1498#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,308 INFO L272 TraceCheckUtils]: 10: Hoare triple {1499#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1493#true} is VALID [2022-04-14 14:34:00,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {1493#true} ~cond := #in~cond; {1493#true} is VALID [2022-04-14 14:34:00,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1493#true} assume !(0 == ~cond); {1493#true} is VALID [2022-04-14 14:34:00,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:00,309 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1493#true} {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #79#return; {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#(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); {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {1499#(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); {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {1499#(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); {1499#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:00,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {1499#(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; {1494#false} is VALID [2022-04-14 14:34:00,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {1494#false} ~l~0 := 1 + ~l~0; {1494#false} is VALID [2022-04-14 14:34:00,311 INFO L272 TraceCheckUtils]: 21: Hoare triple {1494#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1494#false} is VALID [2022-04-14 14:34:00,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {1494#false} ~cond := #in~cond; {1494#false} is VALID [2022-04-14 14:34:00,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {1494#false} assume 0 == ~cond; {1494#false} is VALID [2022-04-14 14:34:00,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-14 14:34:00,312 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-14 14:34:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:34:00,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254669536] [2022-04-14 14:34:00,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254669536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:00,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327859171] [2022-04-14 14:34:00,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:34:00,314 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-14 14:34:00,315 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-14 14:34:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:00,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 14:34:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:00,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:34:00,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-14 14:34:00,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#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; {1493#true} is VALID [2022-04-14 14:34:00,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:00,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #81#return; {1493#true} is VALID [2022-04-14 14:34:00,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-14 14:34:00,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1523#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1523#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1523#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#(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) (= 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; {1533#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,817 INFO L272 TraceCheckUtils]: 10: Hoare triple {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1493#true} is VALID [2022-04-14 14:34:00,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {1493#true} ~cond := #in~cond; {1493#true} is VALID [2022-04-14 14:34:00,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1493#true} assume !(0 == ~cond); {1493#true} is VALID [2022-04-14 14:34:00,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:00,818 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1493#true} {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1537#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1568#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {1568#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1572#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= (+ (- 1) main_~l~0) 1) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:00,821 INFO L272 TraceCheckUtils]: 21: Hoare triple {1572#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= (+ (- 1) main_~l~0) 1) (= (+ (- 1) 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:00,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1580#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:00,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {1580#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1494#false} is VALID [2022-04-14 14:34:00,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-14 14:34:00,822 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-14 14:34:00,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:34:01,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-14 14:34:01,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {1580#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1494#false} is VALID [2022-04-14 14:34:01,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1580#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:01,039 INFO L272 TraceCheckUtils]: 21: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1576#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:01,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {1600#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:01,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {1600#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:34:01,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:01,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:01,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:01,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:01,089 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1493#true} {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:01,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:01,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {1493#true} assume !(0 == ~cond); {1493#true} is VALID [2022-04-14 14:34:01,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {1493#true} ~cond := #in~cond; {1493#true} is VALID [2022-04-14 14:34:01,089 INFO L272 TraceCheckUtils]: 10: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1493#true} is VALID [2022-04-14 14:34:01,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {1600#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:03,226 WARN L290 TraceCheckUtils]: 8: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {1600#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:03,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:03,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:03,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1596#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:03,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-14 14:34:03,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #81#return; {1493#true} is VALID [2022-04-14 14:34:03,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-14 14:34:03,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#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; {1493#true} is VALID [2022-04-14 14:34:03,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-14 14:34:03,228 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-14 14:34:03,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327859171] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:03,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:34:03,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:34:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033678478] [2022-04-14 14:34:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:34:03,229 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-14 14:34:03,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:34:03,229 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-14 14:34:05,382 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-14 14:34:05,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:34:05,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:34:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:34:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:34:05,384 INFO L87 Difference]: Start difference. First operand 52 states and 65 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-14 14:34:07,489 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-14 14:34:09,665 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-14 14:34:11,829 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-14 14:34:13,932 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-14 14:34:16,040 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-14 14:34:18,159 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-14 14:34:20,268 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-14 14:34:24,499 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-14 14:34:26,703 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-14 14:34:28,875 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-14 14:34:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:29,053 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-14 14:34:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:34:29,053 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-14 14:34:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:34:29,053 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-14 14:34:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:34:29,054 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-14 14:34:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:34:29,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:34:31,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 46 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:34:31,227 INFO L225 Difference]: With dead ends: 67 [2022-04-14 14:34:31,227 INFO L226 Difference]: Without dead ends: 65 [2022-04-14 14:34:31,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 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-14 14:34:31,228 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:34:31,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 10 Unknown, 0 Unchecked, 21.4s Time] [2022-04-14 14:34:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-14 14:34:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-04-14 14:34:31,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:34:31,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 64 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-14 14:34:31,266 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 64 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-14 14:34:31,266 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 64 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-14 14:34:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:31,268 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-14 14:34:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-14 14:34:31,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:31,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:31,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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 65 states. [2022-04-14 14:34:31,268 INFO L87 Difference]: Start difference. First operand has 64 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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 65 states. [2022-04-14 14:34:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:31,269 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-14 14:34:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-14 14:34:31,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:31,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:31,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:34:31,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:34:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-14 14:34:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2022-04-14 14:34:31,271 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 25 [2022-04-14 14:34:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:34:31,271 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2022-04-14 14:34:31,271 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-14 14:34:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-04-14 14:34:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 14:34:31,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:34:31,272 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-14 14:34:31,289 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-14 14:34:31,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:31,488 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:34:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:34:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1316608760, now seen corresponding path program 1 times [2022-04-14 14:34:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:34:31,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464902472] [2022-04-14 14:34:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:34:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:34:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:31,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {1980#(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; {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:34:31,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:34:31,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1966#true} #81#return; {1971#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:34:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:34:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:31,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2022-04-14 14:34:31,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2022-04-14 14:34:31,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2022-04-14 14:34:31,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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))} #79#return; {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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-14 14:34:31,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1980#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:34:31,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1980#(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; {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:34:31,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:34:31,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1981#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1966#true} #81#return; {1971#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:34:31,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1971#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:34:31,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1972#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:34:31,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {1972#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1973#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:34:31,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1973#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1973#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:34:31,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1973#(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 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {1973#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:34:31,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1973#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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-14 14:34:31,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1966#true} is VALID [2022-04-14 14:34:31,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2022-04-14 14:34:31,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2022-04-14 14:34:31,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1966#true} assume true; {1966#true} is VALID [2022-04-14 14:34:31,726 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1966#true} {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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))} #79#return; {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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-14 14:34:31,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {1974#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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 !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1979#(<= (+ (* 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-14 14:34:31,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#(<= (+ (* 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); {1979#(<= (+ (* 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-14 14:34:31,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#(<= (+ (* 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); {1979#(<= (+ (* 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-14 14:34:31,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#(<= (+ (* 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); {1979#(<= (+ (* 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-14 14:34:31,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {1979#(<= (+ (* 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); {1979#(<= (+ (* 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-14 14:34:31,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {1979#(<= (+ (* 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; {1967#false} is VALID [2022-04-14 14:34:31,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {1967#false} ~l~0 := 1 + ~l~0; {1967#false} is VALID [2022-04-14 14:34:31,730 INFO L272 TraceCheckUtils]: 22: Hoare triple {1967#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1967#false} is VALID [2022-04-14 14:34:31,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {1967#false} ~cond := #in~cond; {1967#false} is VALID [2022-04-14 14:34:31,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {1967#false} assume 0 == ~cond; {1967#false} is VALID [2022-04-14 14:34:31,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2022-04-14 14:34:31,731 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-14 14:34:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:34:31,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464902472] [2022-04-14 14:34:31,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464902472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:31,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228478034] [2022-04-14 14:34:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:34:31,732 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-14 14:34:31,733 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-14 14:34:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:31,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 14:34:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:31,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:34:32,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2022-04-14 14:34:32,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1966#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; {1966#true} is VALID [2022-04-14 14:34:32,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2022-04-14 14:34:32,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #81#return; {1966#true} is VALID [2022-04-14 14:34:32,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {1966#true} call #t~ret5 := main(); {1966#true} is VALID [2022-04-14 14:34:32,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1966#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2000#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:32,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {2000#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2000#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:32,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2000#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:32,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#(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) (= 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; {2010#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:32,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {2010#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2014#(and (= 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-14 14:34:32,320 INFO L272 TraceCheckUtils]: 10: Hoare triple {2014#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1966#true} is VALID [2022-04-14 14:34:32,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2022-04-14 14:34:32,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2022-04-14 14:34:32,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1966#true} assume true; {1966#true} is VALID [2022-04-14 14:34:32,321 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1966#true} {2014#(and (= 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))} #79#return; {2014#(and (= 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-14 14:34:32,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {2014#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2014#(and (= 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-14 14:34:32,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {2014#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2014#(and (= 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-14 14:34:32,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {2014#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2014#(and (= 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-14 14:34:32,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {2014#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2014#(and (= 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-14 14:34:32,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {2014#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2014#(and (= 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-14 14:34:32,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {2014#(and (= 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))} 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; {2048#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:32,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2052#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:32,327 INFO L272 TraceCheckUtils]: 22: Hoare triple {2052#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:32,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {2056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:32,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {2060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1967#false} is VALID [2022-04-14 14:34:32,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2022-04-14 14:34:32,328 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-14 14:34:32,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:34:32,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2022-04-14 14:34:32,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {2060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1967#false} is VALID [2022-04-14 14:34:32,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {2056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:32,591 INFO L272 TraceCheckUtils]: 22: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:32,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {2080#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,690 WARN L290 TraceCheckUtils]: 20: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {2080#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:34,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,693 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1966#true} {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:34,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {1966#true} assume true; {1966#true} is VALID [2022-04-14 14:34:34,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {1966#true} assume !(0 == ~cond); {1966#true} is VALID [2022-04-14 14:34:34,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {1966#true} ~cond := #in~cond; {1966#true} is VALID [2022-04-14 14:34:34,693 INFO L272 TraceCheckUtils]: 10: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1966#true} is VALID [2022-04-14 14:34:34,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {2080#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:36,811 WARN L290 TraceCheckUtils]: 8: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {2080#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:36,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:36,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:36,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1966#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2076#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:36,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {1966#true} call #t~ret5 := main(); {1966#true} is VALID [2022-04-14 14:34:36,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #81#return; {1966#true} is VALID [2022-04-14 14:34:36,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2022-04-14 14:34:36,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {1966#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; {1966#true} is VALID [2022-04-14 14:34:36,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2022-04-14 14:34:36,813 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-14 14:34:36,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228478034] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:36,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:34:36,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 18 [2022-04-14 14:34:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325215751] [2022-04-14 14:34:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:34:36,814 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-14 14:34:36,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:34:36,814 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-14 14:34:41,061 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-14 14:34:41,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:34:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:34:41,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:34:41,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:34:41,062 INFO L87 Difference]: Start difference. First operand 64 states and 82 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-14 14:34:43,173 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-14 14:34:45,337 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-14 14:34:47,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-14 14:34:49,680 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-14 14:34:51,786 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-14 14:34:54,111 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-14 14:34:56,333 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-14 14:34:58,466 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-14 14:34:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:58,626 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-04-14 14:34:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:34:58,626 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-14 14:34:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:34:58,626 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-14 14:34:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:34:58,627 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-14 14:34:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:34:58,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:35:02,935 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-14 14:35:02,936 INFO L225 Difference]: With dead ends: 78 [2022-04-14 14:35:02,936 INFO L226 Difference]: Without dead ends: 76 [2022-04-14 14:35:02,936 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:35:02,937 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:35:02,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 8 Unknown, 0 Unchecked, 17.1s Time] [2022-04-14 14:35:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-14 14:35:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-04-14 14:35:02,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:35:02,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-14 14:35:02,978 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-14 14:35:02,979 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-14 14:35:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:02,980 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-04-14 14:35:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-04-14 14:35:02,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:02,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:02,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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 76 states. [2022-04-14 14:35:02,981 INFO L87 Difference]: Start difference. First operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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 76 states. [2022-04-14 14:35:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:02,982 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-04-14 14:35:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-04-14 14:35:02,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:02,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:02,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:35:02,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:35:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-14 14:35:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-14 14:35:02,984 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 26 [2022-04-14 14:35:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:35:02,985 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-14 14:35:02,985 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-14 14:35:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-14 14:35:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 14:35:02,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:35:02,986 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-14 14:35:03,001 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-14 14:35:03,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:03,196 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:35:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:35:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -520591293, now seen corresponding path program 1 times [2022-04-14 14:35:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:35:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057358091] [2022-04-14 14:35:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:35:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:35:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:03,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {2497#(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; {2486#true} is VALID [2022-04-14 14:35:03,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2486#true} {2486#true} #81#return; {2486#true} is VALID [2022-04-14 14:35:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:35:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:03,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-14 14:35:03,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-14 14:35:03,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2497#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:35:03,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {2497#(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; {2486#true} is VALID [2022-04-14 14:35:03,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #81#return; {2486#true} is VALID [2022-04-14 14:35:03,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-14 14:35:03,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2491#(= main_~l~0 0)} is VALID [2022-04-14 14:35:03,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {2491#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2491#(= main_~l~0 0)} is VALID [2022-04-14 14:35:03,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2491#(= main_~l~0 0)} is VALID [2022-04-14 14:35:03,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(= main_~l~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; {2491#(= main_~l~0 0)} is VALID [2022-04-14 14:35:03,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,267 INFO L272 TraceCheckUtils]: 10: Hoare triple {2492#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2486#true} is VALID [2022-04-14 14:35:03,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-14 14:35:03,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-14 14:35:03,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,268 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2486#true} {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {2492#(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); {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {2492#(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); {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {2492#(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); {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {2492#(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); {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {2492#(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); {2492#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:03,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2492#(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; {2487#false} is VALID [2022-04-14 14:35:03,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {2487#false} ~l~0 := 1 + ~l~0; {2487#false} is VALID [2022-04-14 14:35:03,271 INFO L272 TraceCheckUtils]: 23: Hoare triple {2487#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2487#false} is VALID [2022-04-14 14:35:03,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} ~cond := #in~cond; {2487#false} is VALID [2022-04-14 14:35:03,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {2487#false} assume 0 == ~cond; {2487#false} is VALID [2022-04-14 14:35:03,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-14 14:35:03,271 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-14 14:35:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:35:03,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057358091] [2022-04-14 14:35:03,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057358091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:03,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868453594] [2022-04-14 14:35:03,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:03,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:03,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:35:03,275 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-14 14:35:03,276 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-14 14:35:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:03,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-14 14:35:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:03,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:35:03,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-14 14:35:03,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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; {2486#true} is VALID [2022-04-14 14:35:03,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #81#return; {2486#true} is VALID [2022-04-14 14:35:03,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-14 14:35:03,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2516#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:03,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {2516#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2516#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:03,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {2516#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2516#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:03,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#(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) (= 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; {2526#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:03,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {2526#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2530#(and (= 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-14 14:35:03,751 INFO L272 TraceCheckUtils]: 10: Hoare triple {2530#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2486#true} is VALID [2022-04-14 14:35:03,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-14 14:35:03,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-14 14:35:03,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,751 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2486#true} {2530#(and (= 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))} #79#return; {2530#(and (= 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-14 14:35:03,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {2530#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2530#(and (= 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-14 14:35:03,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {2530#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2530#(and (= 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-14 14:35:03,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {2530#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2530#(and (= 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-14 14:35:03,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {2530#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2530#(and (= 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-14 14:35:03,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {2530#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2530#(and (= 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-14 14:35:03,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {2530#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2530#(and (= 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-14 14:35:03,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {2530#(and (= 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))} 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; {2567#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:03,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {2567#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2571#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:03,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {2571#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:03,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:03,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-14 14:35:03,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-14 14:35:03,756 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-14 14:35:03,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:35:03,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-14 14:35:03,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2487#false} is VALID [2022-04-14 14:35:03,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:03,963 INFO L272 TraceCheckUtils]: 23: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:03,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {2599#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {2599#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:35:03,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,984 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2486#true} {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:03,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:03,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {2486#true} assume !(0 == ~cond); {2486#true} is VALID [2022-04-14 14:35:03,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#true} ~cond := #in~cond; {2486#true} is VALID [2022-04-14 14:35:03,984 INFO L272 TraceCheckUtils]: 10: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2486#true} is VALID [2022-04-14 14:35:03,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {2599#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:06,111 WARN L290 TraceCheckUtils]: 8: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {2599#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:35:06,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:06,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:06,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2595#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:06,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-14 14:35:06,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #81#return; {2486#true} is VALID [2022-04-14 14:35:06,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-14 14:35:06,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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; {2486#true} is VALID [2022-04-14 14:35:06,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-14 14:35:06,115 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-14 14:35:06,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868453594] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:06,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:35:06,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:35:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443540272] [2022-04-14 14:35:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:35:06,116 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-14 14:35:06,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:35:06,116 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-14 14:35:08,261 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-14 14:35:08,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:35:08,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:35:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:35:08,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:35:08,262 INFO L87 Difference]: Start difference. First operand 65 states and 84 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-14 14:35:10,379 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-14 14:35:12,566 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-14 14:35:14,733 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-14 14:35:16,852 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-14 14:35:18,977 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-14 14:35:21,100 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-14 14:35:23,241 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-14 14:35:25,362 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-14 14:35:27,588 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-14 14:35:29,753 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-14 14:35:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:29,997 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2022-04-14 14:35:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:35:29,997 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-14 14:35:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:35:29,998 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-14 14:35:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:35:29,998 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-14 14:35:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:35:30,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:35:32,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:35:32,216 INFO L225 Difference]: With dead ends: 92 [2022-04-14 14:35:32,216 INFO L226 Difference]: Without dead ends: 90 [2022-04-14 14:35:32,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 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-14 14:35:32,217 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-04-14 14:35:32,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 10 Unknown, 0 Unchecked, 21.5s Time] [2022-04-14 14:35:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-14 14:35:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-14 14:35:32,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:35:32,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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-14 14:35:32,260 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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-14 14:35:32,261 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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-14 14:35:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:32,262 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-04-14 14:35:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2022-04-14 14:35:32,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:32,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:32,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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 90 states. [2022-04-14 14:35:32,263 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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 90 states. [2022-04-14 14:35:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:32,265 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-04-14 14:35:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2022-04-14 14:35:32,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:32,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:32,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:35:32,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:35:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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-14 14:35:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2022-04-14 14:35:32,267 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 27 [2022-04-14 14:35:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:35:32,267 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2022-04-14 14:35:32,267 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-14 14:35:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2022-04-14 14:35:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 14:35:32,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:35:32,268 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-14 14:35:32,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 14:35:32,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:32,483 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:35:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:35:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1486769898, now seen corresponding path program 1 times [2022-04-14 14:35:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:35:32,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175085122] [2022-04-14 14:35:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:32,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:35:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:35:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:32,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {3104#(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; {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:32,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:32,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {3084#true} #81#return; {3089#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:35:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:32,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:32,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:32,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:32,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3084#true} {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} #79#return; {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:35:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:32,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:32,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:32,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:32,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3084#true} {3097#(or (<= (+ (* (div main_~l~0 4294967296) 6148914689804861440) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 6148914694099828736) 2863311530 (* 8589934592 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6))) (* main_~l~0 1431655765)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {3102#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 4294967296)) main_~l~0))} is VALID [2022-04-14 14:35:32,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {3084#true} call ULTIMATE.init(); {3104#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:35:32,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {3104#(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; {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:32,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:32,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3105#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {3084#true} #81#return; {3089#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:32,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {3089#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {3089#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:32,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {3089#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3090#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:32,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {3090#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3091#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:32,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {3091#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3091#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:32,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {3091#(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 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {3091#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:32,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {3091#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,769 INFO L272 TraceCheckUtils]: 10: Hoare triple {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3084#true} is VALID [2022-04-14 14:35:32,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:32,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:32,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:32,770 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3084#true} {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} #79#return; {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} 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; {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} is VALID [2022-04-14 14:35:32,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {3092#(<= (+ (* (div (+ (* (- 1) (div (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~l~0 1) 3) 4294967296) 1431655765) (* main_~l~0 1431655765))} ~l~0 := 1 + ~l~0; {3097#(or (<= (+ (* (div main_~l~0 4294967296) 6148914689804861440) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 6148914694099828736) 2863311530 (* 8589934592 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6))) (* main_~l~0 1431655765)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:32,777 INFO L272 TraceCheckUtils]: 20: Hoare triple {3097#(or (<= (+ (* (div main_~l~0 4294967296) 6148914689804861440) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 6148914694099828736) 2863311530 (* 8589934592 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6))) (* main_~l~0 1431655765)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3084#true} is VALID [2022-04-14 14:35:32,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:32,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:32,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:32,779 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3084#true} {3097#(or (<= (+ (* (div main_~l~0 4294967296) 6148914689804861440) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 6148914694099828736) 2863311530 (* 8589934592 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6))) (* main_~l~0 1431655765)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {3102#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 4294967296)) main_~l~0))} is VALID [2022-04-14 14:35:32,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {3102#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 4294967296)) main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3103#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-14 14:35:32,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {3103#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 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); {3103#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-14 14:35:32,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {3103#(<= (+ (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 2 (* (div main_~l~0 4294967296) 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; {3085#false} is VALID [2022-04-14 14:35:32,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {3085#false} ~l~0 := 1 + ~l~0; {3085#false} is VALID [2022-04-14 14:35:32,783 INFO L272 TraceCheckUtils]: 29: Hoare triple {3085#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3085#false} is VALID [2022-04-14 14:35:32,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {3085#false} ~cond := #in~cond; {3085#false} is VALID [2022-04-14 14:35:32,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {3085#false} assume 0 == ~cond; {3085#false} is VALID [2022-04-14 14:35:32,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {3085#false} assume !false; {3085#false} is VALID [2022-04-14 14:35:32,783 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-14 14:35:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:35:32,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175085122] [2022-04-14 14:35:32,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175085122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:32,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890053640] [2022-04-14 14:35:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:35:32,784 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-14 14:35:32,785 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-14 14:35:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:32,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:35:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:32,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:35:33,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {3084#true} call ULTIMATE.init(); {3084#true} is VALID [2022-04-14 14:35:33,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {3084#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; {3084#true} is VALID [2022-04-14 14:35:33,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:33,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3084#true} {3084#true} #81#return; {3084#true} is VALID [2022-04-14 14:35:33,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {3084#true} call #t~ret5 := main(); {3084#true} is VALID [2022-04-14 14:35:33,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {3084#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3124#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {3124#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3124#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {3124#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3124#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {3124#(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) (= 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; {3134#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,471 INFO L272 TraceCheckUtils]: 10: Hoare triple {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3084#true} is VALID [2022-04-14 14:35:33,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:33,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:33,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:33,471 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3084#true} {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:33,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {3138#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {3166#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {3166#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,474 INFO L272 TraceCheckUtils]: 20: Hoare triple {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3084#true} is VALID [2022-04-14 14:35:33,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:33,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:33,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:33,474 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3084#true} {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} #79#return; {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {3170#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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;~v2~0 := 1 + ~v2~0; {3195#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {3195#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {3199#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 2) main_~l~0) 1) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:33,477 INFO L272 TraceCheckUtils]: 29: Hoare triple {3199#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 2) main_~l~0) 1) (= main_~v2~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:33,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {3203#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:33,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {3207#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3085#false} is VALID [2022-04-14 14:35:33,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {3085#false} assume !false; {3085#false} is VALID [2022-04-14 14:35:33,478 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-14 14:35:33,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:35:33,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {3085#false} assume !false; {3085#false} is VALID [2022-04-14 14:35:33,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {3207#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3085#false} is VALID [2022-04-14 14:35:33,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {3203#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:33,854 INFO L272 TraceCheckUtils]: 29: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:33,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {3227#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:35,980 WARN L290 TraceCheckUtils]: 27: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {3227#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:35:35,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:35,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:35,982 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3084#true} {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:35,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:35,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:35,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:35,982 INFO L272 TraceCheckUtils]: 20: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3084#true} is VALID [2022-04-14 14:35:35,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {3227#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,095 WARN L290 TraceCheckUtils]: 18: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {3227#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:35:38,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,097 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3084#true} {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:38,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {3084#true} assume !(0 == ~cond); {3084#true} is VALID [2022-04-14 14:35:38,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {3084#true} ~cond := #in~cond; {3084#true} is VALID [2022-04-14 14:35:38,097 INFO L272 TraceCheckUtils]: 10: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3084#true} is VALID [2022-04-14 14:35:38,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {3227#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {3227#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:35:38,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {3084#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3223#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:38,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {3084#true} call #t~ret5 := main(); {3084#true} is VALID [2022-04-14 14:35:38,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3084#true} {3084#true} #81#return; {3084#true} is VALID [2022-04-14 14:35:38,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {3084#true} assume true; {3084#true} is VALID [2022-04-14 14:35:38,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {3084#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; {3084#true} is VALID [2022-04-14 14:35:38,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {3084#true} call ULTIMATE.init(); {3084#true} is VALID [2022-04-14 14:35:38,108 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-14 14:35:38,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890053640] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:38,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:35:38,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 22 [2022-04-14 14:35:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896617679] [2022-04-14 14:35:38,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:35:38,108 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-14 14:35:38,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:35:38,109 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-14 14:35:44,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 20 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:35:44,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:35:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:35:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:35:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-04-14 14:35:44,488 INFO L87 Difference]: Start difference. First operand 90 states and 120 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-14 14:35:46,536 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-14 14:35:48,723 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-14 14:35:50,891 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-14 14:35:53,085 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-14 14:35:55,183 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-14 14:35:57,343 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-14 14:36:01,732 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-14 14:36:08,287 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-14 14:36:10,533 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-14 14:36:12,644 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-14 14:36:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:12,805 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2022-04-14 14:36:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:36:12,805 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-14 14:36:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:36:12,805 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-14 14:36:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-14 14:36:12,806 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-14 14:36:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-14 14:36:12,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-14 14:36:19,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 40 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:36:19,181 INFO L225 Difference]: With dead ends: 102 [2022-04-14 14:36:19,181 INFO L226 Difference]: Without dead ends: 100 [2022-04-14 14:36:19,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-14 14:36:19,182 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-04-14 14:36:19,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 20.8s Time] [2022-04-14 14:36:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-14 14:36:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2022-04-14 14:36:19,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:36:19,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 81 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:36:19,221 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 81 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:36:19,221 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 81 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:36:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:19,223 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-14 14:36:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-14 14:36:19,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:36:19,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:36:19,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 100 states. [2022-04-14 14:36:19,223 INFO L87 Difference]: Start difference. First operand has 81 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 100 states. [2022-04-14 14:36:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:19,225 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-14 14:36:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-14 14:36:19,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:36:19,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:36:19,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:36:19,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:36:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:36:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2022-04-14 14:36:19,227 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 33 [2022-04-14 14:36:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:36:19,227 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2022-04-14 14:36:19,227 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-14 14:36:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2022-04-14 14:36:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 14:36:19,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:36:19,243 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-14 14:36:19,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-14 14:36:19,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:36:19,451 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:36:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:36:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1634686171, now seen corresponding path program 1 times [2022-04-14 14:36:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:36:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972060149] [2022-04-14 14:36:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:36:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:36:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:36:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:19,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {3766#(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; {3751#true} is VALID [2022-04-14 14:36:19,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:19,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3751#true} {3751#true} #81#return; {3751#true} is VALID [2022-04-14 14:36:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:36:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:19,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:19,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:19,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:19,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #79#return; {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-14 14:36:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:19,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:19,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:19,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3752#false} #79#return; {3752#false} is VALID [2022-04-14 14:36:19,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3766#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:36:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {3766#(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; {3751#true} is VALID [2022-04-14 14:36:19,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:19,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #81#return; {3751#true} is VALID [2022-04-14 14:36:19,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret5 := main(); {3751#true} is VALID [2022-04-14 14:36:19,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {3751#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3756#(= main_~l~0 0)} is VALID [2022-04-14 14:36:19,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {3756#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3756#(= main_~l~0 0)} is VALID [2022-04-14 14:36:19,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {3756#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3756#(= main_~l~0 0)} is VALID [2022-04-14 14:36:19,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {3756#(= main_~l~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; {3756#(= main_~l~0 0)} is VALID [2022-04-14 14:36:19,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {3756#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,532 INFO L272 TraceCheckUtils]: 10: Hoare triple {3757#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3751#true} is VALID [2022-04-14 14:36:19,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:19,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:19,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:19,533 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3751#true} {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #79#return; {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {3757#(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); {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {3757#(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); {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {3757#(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); {3757#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {3757#(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; {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {3752#false} ~l~0 := 1 + ~l~0; {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L272 TraceCheckUtils]: 21: Hoare triple {3752#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3751#true} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:19,535 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3751#true} {3752#false} #79#return; {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {3752#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {3752#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); {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {3752#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;~v2~0 := 1 + ~v2~0; {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {3752#false} ~l~0 := 1 + ~l~0; {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L272 TraceCheckUtils]: 30: Hoare triple {3752#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {3752#false} ~cond := #in~cond; {3752#false} is VALID [2022-04-14 14:36:19,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {3752#false} assume 0 == ~cond; {3752#false} is VALID [2022-04-14 14:36:19,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {3752#false} assume !false; {3752#false} is VALID [2022-04-14 14:36:19,536 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-14 14:36:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:36:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972060149] [2022-04-14 14:36:19,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972060149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:36:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136273882] [2022-04-14 14:36:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:36:19,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:36:19,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:36:19,537 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-14 14:36:19,537 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-14 14:36:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:19,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:36:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:19,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:36:20,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3751#true} is VALID [2022-04-14 14:36:20,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {3751#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; {3751#true} is VALID [2022-04-14 14:36:20,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:20,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #81#return; {3751#true} is VALID [2022-04-14 14:36:20,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret5 := main(); {3751#true} is VALID [2022-04-14 14:36:20,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {3751#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3785#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {3785#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3785#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {3785#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3785#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {3785#(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) (= 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; {3795#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {3795#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,143 INFO L272 TraceCheckUtils]: 10: Hoare triple {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3751#true} is VALID [2022-04-14 14:36:20,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:20,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:20,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:20,143 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3751#true} {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {3799#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {3830#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,146 INFO L272 TraceCheckUtils]: 21: Hoare triple {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3751#true} is VALID [2022-04-14 14:36:20,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:20,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:20,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:20,147 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3751#true} {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} #79#return; {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= 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); {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {3834#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3859#(and (= 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 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {3859#(and (= 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 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3863#(and (= 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 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:20,149 INFO L272 TraceCheckUtils]: 30: Hoare triple {3863#(and (= 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 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:36:20,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {3867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:36:20,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {3871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3752#false} is VALID [2022-04-14 14:36:20,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {3752#false} assume !false; {3752#false} is VALID [2022-04-14 14:36:20,150 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-14 14:36:20,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:36:20,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {3752#false} assume !false; {3752#false} is VALID [2022-04-14 14:36:20,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {3871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3752#false} is VALID [2022-04-14 14:36:20,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {3867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:36:20,406 INFO L272 TraceCheckUtils]: 30: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:36:20,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {3891#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,529 WARN L290 TraceCheckUtils]: 28: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {3891#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:36:22,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,531 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3751#true} {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:22,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:22,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:22,531 INFO L272 TraceCheckUtils]: 21: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3751#true} is VALID [2022-04-14 14:36:22,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {3891#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {3891#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:36:22,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,543 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3751#true} {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:22,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:22,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {3751#true} assume !(0 == ~cond); {3751#true} is VALID [2022-04-14 14:36:22,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {3751#true} ~cond := #in~cond; {3751#true} is VALID [2022-04-14 14:36:22,543 INFO L272 TraceCheckUtils]: 10: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3751#true} is VALID [2022-04-14 14:36:22,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3891#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:24,658 WARN L290 TraceCheckUtils]: 8: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {3891#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:36:24,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:24,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:24,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3751#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3887#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:24,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {3751#true} call #t~ret5 := main(); {3751#true} is VALID [2022-04-14 14:36:24,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3751#true} {3751#true} #81#return; {3751#true} is VALID [2022-04-14 14:36:24,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {3751#true} assume true; {3751#true} is VALID [2022-04-14 14:36:24,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {3751#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; {3751#true} is VALID [2022-04-14 14:36:24,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {3751#true} call ULTIMATE.init(); {3751#true} is VALID [2022-04-14 14:36:24,661 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-14 14:36:24,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136273882] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:36:24,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:36:24,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:36:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876158180] [2022-04-14 14:36:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:36:24,662 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-14 14:36:24,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:36:24,662 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-14 14:36:28,937 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-14 14:36:28,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:36:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:36:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:36:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:36:28,938 INFO L87 Difference]: Start difference. First operand 81 states and 109 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-14 14:36:31,034 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-14 14:36:33,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:35,410 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-14 14:36:37,536 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-14 14:36:39,673 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-14 14:36:41,794 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-14 14:36:44,045 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-14 14:36:46,221 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-14 14:36:48,398 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-14 14:36:50,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-14 14:36:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:50,672 INFO L93 Difference]: Finished difference Result 105 states and 141 transitions. [2022-04-14 14:36:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:36:50,672 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-14 14:36:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:36:50,673 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-14 14:36:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:36:50,674 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-14 14:36:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:36:50,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:36:54,949 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-14 14:36:54,950 INFO L225 Difference]: With dead ends: 105 [2022-04-14 14:36:54,950 INFO L226 Difference]: Without dead ends: 103 [2022-04-14 14:36:54,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:36:54,951 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:36:54,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 10 Unknown, 0 Unchecked, 21.1s Time] [2022-04-14 14:36:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-14 14:36:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-04-14 14:36:55,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:36:55,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 102 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 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-14 14:36:55,002 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 102 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 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-14 14:36:55,003 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 102 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 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-14 14:36:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:55,004 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2022-04-14 14:36:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2022-04-14 14:36:55,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:36:55,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:36:55,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 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 103 states. [2022-04-14 14:36:55,005 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 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 103 states. [2022-04-14 14:36:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:55,006 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2022-04-14 14:36:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2022-04-14 14:36:55,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:36:55,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:36:55,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:36:55,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:36:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 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-14 14:36:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-04-14 14:36:55,008 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 34 [2022-04-14 14:36:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:36:55,008 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-04-14 14:36:55,008 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-14 14:36:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-04-14 14:36:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 14:36:55,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:36:55,009 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] [2022-04-14 14:36:55,047 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-14 14:36:55,215 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,SelfDestructingSolverStorable9 [2022-04-14 14:36:55,215 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:36:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:36:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1651072497, now seen corresponding path program 1 times [2022-04-14 14:36:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:36:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103226624] [2022-04-14 14:36:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:36:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:36:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:55,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:36:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:55,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {4470#(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; {4454#true} is VALID [2022-04-14 14:36:55,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4454#true} {4454#true} #81#return; {4454#true} is VALID [2022-04-14 14:36:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:36:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:55,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:55,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:55,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:36:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:55,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:55,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:55,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #79#return; {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {4454#true} call ULTIMATE.init(); {4470#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:36:55,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {4470#(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; {4454#true} is VALID [2022-04-14 14:36:55,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #81#return; {4454#true} is VALID [2022-04-14 14:36:55,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret5 := main(); {4454#true} is VALID [2022-04-14 14:36:55,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4459#(= main_~l~0 0)} is VALID [2022-04-14 14:36:55,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {4459#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4459#(= main_~l~0 0)} is VALID [2022-04-14 14:36:55,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {4459#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4459#(= main_~l~0 0)} is VALID [2022-04-14 14:36:55,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {4459#(= main_~l~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; {4459#(= main_~l~0 0)} is VALID [2022-04-14 14:36:55,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {4459#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,299 INFO L272 TraceCheckUtils]: 10: Hoare triple {4460#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4454#true} is VALID [2022-04-14 14:36:55,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:55,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:55,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,300 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4454#true} {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {4460#(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); {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {4460#(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); {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {4460#(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; {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:36:55,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {4460#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,303 INFO L272 TraceCheckUtils]: 20: Hoare triple {4465#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4454#true} is VALID [2022-04-14 14:36:55,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:55,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:55,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,303 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4454#true} {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #79#return; {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {4465#(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); {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {4465#(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); {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {4465#(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); {4465#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:36:55,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {4465#(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; {4455#false} is VALID [2022-04-14 14:36:55,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {4455#false} ~l~0 := 1 + ~l~0; {4455#false} is VALID [2022-04-14 14:36:55,306 INFO L272 TraceCheckUtils]: 31: Hoare triple {4455#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4455#false} is VALID [2022-04-14 14:36:55,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {4455#false} ~cond := #in~cond; {4455#false} is VALID [2022-04-14 14:36:55,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {4455#false} assume 0 == ~cond; {4455#false} is VALID [2022-04-14 14:36:55,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-14 14:36:55,306 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-14 14:36:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:36:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103226624] [2022-04-14 14:36:55,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103226624] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:36:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904337757] [2022-04-14 14:36:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:36:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:36:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:36:55,307 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-14 14:36:55,312 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-14 14:36:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:55,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:36:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:55,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:36:55,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {4454#true} call ULTIMATE.init(); {4454#true} is VALID [2022-04-14 14:36:55,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#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; {4454#true} is VALID [2022-04-14 14:36:55,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #81#return; {4454#true} is VALID [2022-04-14 14:36:55,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret5 := main(); {4454#true} is VALID [2022-04-14 14:36:55,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4489#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {4489#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4489#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {4489#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4489#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {4489#(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) (= 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; {4499#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4499#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4454#true} is VALID [2022-04-14 14:36:55,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:55,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:55,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,943 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4454#true} {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:55,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4531#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {4531#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,945 INFO L272 TraceCheckUtils]: 20: Hoare triple {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4454#true} is VALID [2022-04-14 14:36:55,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:55,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:55,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:55,946 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4454#true} {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} #79#return; {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:36:55,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {4535#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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; {4566#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1))} is VALID [2022-04-14 14:36:55,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {4566#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {4570#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1))} is VALID [2022-04-14 14:36:55,949 INFO L272 TraceCheckUtils]: 31: Hoare triple {4570#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4574#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:36:55,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {4574#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4578#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:36:55,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {4578#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4455#false} is VALID [2022-04-14 14:36:55,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-14 14:36:55,950 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-14 14:36:55,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:36:56,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-14 14:36:56,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {4578#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4455#false} is VALID [2022-04-14 14:36:56,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {4574#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4578#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:36:56,204 INFO L272 TraceCheckUtils]: 31: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4574#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:36:56,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {4598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:56,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {4598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:36:56,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:56,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:56,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:56,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:56,259 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4454#true} {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:56,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:56,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:56,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:56,260 INFO L272 TraceCheckUtils]: 20: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4454#true} is VALID [2022-04-14 14:36:56,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {4598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:58,377 WARN L290 TraceCheckUtils]: 18: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {4598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:36:58,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:58,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:58,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:58,379 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4454#true} {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:36:58,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:36:58,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#true} assume !(0 == ~cond); {4454#true} is VALID [2022-04-14 14:36:58,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} ~cond := #in~cond; {4454#true} is VALID [2022-04-14 14:36:58,379 INFO L272 TraceCheckUtils]: 10: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4454#true} is VALID [2022-04-14 14:36:58,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {4598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:00,494 WARN L290 TraceCheckUtils]: 8: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {4598#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:37:00,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:00,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:00,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4594#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:00,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret5 := main(); {4454#true} is VALID [2022-04-14 14:37:00,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #81#return; {4454#true} is VALID [2022-04-14 14:37:00,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-14 14:37:00,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#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; {4454#true} is VALID [2022-04-14 14:37:00,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {4454#true} call ULTIMATE.init(); {4454#true} is VALID [2022-04-14 14:37:00,497 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-14 14:37:00,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904337757] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:00,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:37:00,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-14 14:37:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609327859] [2022-04-14 14:37:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:37:00,497 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 35 [2022-04-14 14:37:00,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:37:00,498 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-14 14:37:04,805 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-14 14:37:04,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:37:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:37:04,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:37:04,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:37:04,806 INFO L87 Difference]: Start difference. First operand 102 states and 137 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-14 14:37:06,938 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-14 14:37:09,111 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-14 14:37:11,284 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-14 14:37:13,417 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-14 14:37:15,624 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-14 14:37:17,801 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-14 14:37:19,962 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-14 14:37:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:20,128 INFO L93 Difference]: Finished difference Result 126 states and 169 transitions. [2022-04-14 14:37:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:37:20,128 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 35 [2022-04-14 14:37:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:37:20,129 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-14 14:37:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:37:20,129 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-14 14:37:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:37:20,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:37:24,412 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-14 14:37:24,413 INFO L225 Difference]: With dead ends: 126 [2022-04-14 14:37:24,413 INFO L226 Difference]: Without dead ends: 124 [2022-04-14 14:37:24,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 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-14 14:37:24,414 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:37:24,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 15.0s Time] [2022-04-14 14:37:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-14 14:37:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-14 14:37:24,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:37:24,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 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-14 14:37:24,477 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 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-14 14:37:24,477 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 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-14 14:37:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:24,479 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2022-04-14 14:37:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 167 transitions. [2022-04-14 14:37:24,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:37:24,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:37:24,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 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 124 states. [2022-04-14 14:37:24,480 INFO L87 Difference]: Start difference. First operand has 123 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 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 124 states. [2022-04-14 14:37:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:24,481 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2022-04-14 14:37:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 167 transitions. [2022-04-14 14:37:24,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:37:24,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:37:24,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:37:24,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:37:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 99 states have internal predecessors, (142), 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-14 14:37:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2022-04-14 14:37:24,483 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 35 [2022-04-14 14:37:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:37:24,484 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2022-04-14 14:37:24,484 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-14 14:37:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2022-04-14 14:37:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 14:37:24,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:37:24,484 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-14 14:37:24,502 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-14 14:37:24,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:37:24,695 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:37:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:37:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1436599045, now seen corresponding path program 1 times [2022-04-14 14:37:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:37:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532034308] [2022-04-14 14:37:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:37:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:37:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:37:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:24,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {5278#(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; {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:24,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:24,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {5260#true} #81#return; {5265#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:37:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:24,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:24,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:24,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:24,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5260#true} {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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))} #79#return; {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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-14 14:37:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 14:37:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:24,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:24,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:24,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:24,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5260#true} {5261#false} #79#return; {5261#false} is VALID [2022-04-14 14:37:24,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {5260#true} call ULTIMATE.init(); {5278#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:37:24,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {5278#(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; {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:24,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:24,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5279#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {5260#true} #81#return; {5265#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:24,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {5265#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:24,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {5265#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5266#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:24,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {5266#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5267#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:37:24,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {5267#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5267#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:37:24,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {5267#(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 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5267#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:37:24,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {5267#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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-14 14:37:24,904 INFO L272 TraceCheckUtils]: 10: Hoare triple {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5260#true} is VALID [2022-04-14 14:37:24,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:24,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:24,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:24,904 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5260#true} {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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))} #79#return; {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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-14 14:37:24,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {5268#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 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 !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5273#(<= (+ (* 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-14 14:37:24,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {5273#(<= (+ (* 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); {5273#(<= (+ (* 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-14 14:37:24,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {5273#(<= (+ (* 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); {5273#(<= (+ (* 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-14 14:37:24,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {5273#(<= (+ (* 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); {5273#(<= (+ (* 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-14 14:37:24,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {5273#(<= (+ (* 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); {5273#(<= (+ (* 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-14 14:37:24,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {5273#(<= (+ (* 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; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {5261#false} ~l~0 := 1 + ~l~0; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {5261#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5260#true} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:24,909 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5260#true} {5261#false} #79#return; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {5261#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {5261#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); {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {5261#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;~v2~0 := 1 + ~v2~0; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {5261#false} ~l~0 := 1 + ~l~0; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L272 TraceCheckUtils]: 31: Hoare triple {5261#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {5261#false} ~cond := #in~cond; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {5261#false} assume 0 == ~cond; {5261#false} is VALID [2022-04-14 14:37:24,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {5261#false} assume !false; {5261#false} is VALID [2022-04-14 14:37:24,910 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-14 14:37:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:37:24,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532034308] [2022-04-14 14:37:24,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532034308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:24,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429771111] [2022-04-14 14:37:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:37:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:37:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:37:24,911 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-14 14:37:24,911 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-14 14:37:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:24,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:37:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:24,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:37:25,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {5260#true} call ULTIMATE.init(); {5260#true} is VALID [2022-04-14 14:37:25,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {5260#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; {5260#true} is VALID [2022-04-14 14:37:25,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:25,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5260#true} {5260#true} #81#return; {5260#true} is VALID [2022-04-14 14:37:25,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {5260#true} call #t~ret5 := main(); {5260#true} is VALID [2022-04-14 14:37:25,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {5260#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5298#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {5298#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5298#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {5298#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5298#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {5298#(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) (= 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; {5308#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {5308#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5312#(and (= 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-14 14:37:25,601 INFO L272 TraceCheckUtils]: 10: Hoare triple {5312#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5260#true} is VALID [2022-04-14 14:37:25,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:25,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:25,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:25,602 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5260#true} {5312#(and (= 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))} #79#return; {5312#(and (= 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-14 14:37:25,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {5312#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5312#(and (= 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-14 14:37:25,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {5312#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5312#(and (= 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-14 14:37:25,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {5312#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5312#(and (= 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-14 14:37:25,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {5312#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {5312#(and (= 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-14 14:37:25,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {5312#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {5312#(and (= 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-14 14:37:25,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {5312#(and (= 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))} 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; {5346#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {5346#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,606 INFO L272 TraceCheckUtils]: 22: Hoare triple {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5260#true} is VALID [2022-04-14 14:37:25,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:25,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:25,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:25,606 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5260#true} {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} #79#return; {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {5350#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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; {5375#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {5375#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5379#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:25,609 INFO L272 TraceCheckUtils]: 31: Hoare triple {5379#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:37:25,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:37:25,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {5387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5261#false} is VALID [2022-04-14 14:37:25,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {5261#false} assume !false; {5261#false} is VALID [2022-04-14 14:37:25,610 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-14 14:37:25,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:37:25,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {5261#false} assume !false; {5261#false} is VALID [2022-04-14 14:37:25,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {5387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5261#false} is VALID [2022-04-14 14:37:25,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:37:25,952 INFO L272 TraceCheckUtils]: 31: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:37:25,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {5407#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:28,078 WARN L290 TraceCheckUtils]: 29: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {5407#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:37:28,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:28,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:28,079 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5260#true} {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:28,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:28,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:28,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:28,080 INFO L272 TraceCheckUtils]: 22: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5260#true} is VALID [2022-04-14 14:37:28,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {5407#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,186 WARN L290 TraceCheckUtils]: 20: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {5407#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:37:30,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,189 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5260#true} {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:30,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:30,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {5260#true} assume !(0 == ~cond); {5260#true} is VALID [2022-04-14 14:37:30,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {5260#true} ~cond := #in~cond; {5260#true} is VALID [2022-04-14 14:37:30,189 INFO L272 TraceCheckUtils]: 10: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5260#true} is VALID [2022-04-14 14:37:30,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:32,324 WARN L290 TraceCheckUtils]: 8: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {5407#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:37:32,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:32,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:32,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {5260#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5403#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:37:32,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {5260#true} call #t~ret5 := main(); {5260#true} is VALID [2022-04-14 14:37:32,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5260#true} {5260#true} #81#return; {5260#true} is VALID [2022-04-14 14:37:32,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {5260#true} assume true; {5260#true} is VALID [2022-04-14 14:37:32,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {5260#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; {5260#true} is VALID [2022-04-14 14:37:32,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {5260#true} call ULTIMATE.init(); {5260#true} is VALID [2022-04-14 14:37:32,328 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-14 14:37:32,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429771111] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:32,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:37:32,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:37:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191293814] [2022-04-14 14:37:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:37:32,329 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-14 14:37:32,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:37:32,329 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-14 14:37:38,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 22 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:37:38,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:37:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:37:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:37:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:37:38,682 INFO L87 Difference]: Start difference. First operand 123 states and 165 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-14 14:37:40,793 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-14 14:37:42,971 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-14 14:37:45,138 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-14 14:37:47,247 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-14 14:37:49,350 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-14 14:37:51,459 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-14 14:37:53,571 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-14 14:37:55,821 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-14 14:37:58,027 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-14 14:38:00,153 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-14 14:38:02,268 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-14 14:38:04,392 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-14 14:38:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:04,537 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-04-14 14:38:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:38:04,537 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-14 14:38:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:38:04,537 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-14 14:38:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:38:04,538 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-14 14:38:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:38:04,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:38:10,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 44 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:38:10,895 INFO L225 Difference]: With dead ends: 137 [2022-04-14 14:38:10,895 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 14:38:10,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:38:10,896 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:38:10,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 25.1s Time] [2022-04-14 14:38:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 14:38:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2022-04-14 14:38:10,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:38:10,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:38:10,952 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:38:10,952 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:38:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:10,954 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-14 14:38:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-14 14:38:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:38:10,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:38:10,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 135 states. [2022-04-14 14:38:10,954 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 135 states. [2022-04-14 14:38:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:10,956 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-14 14:38:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-14 14:38:10,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:38:10,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:38:10,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:38:10,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:38:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:38:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2022-04-14 14:38:10,958 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 35 [2022-04-14 14:38:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:38:10,958 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2022-04-14 14:38:10,958 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-14 14:38:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2022-04-14 14:38:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 14:38:10,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:38:10,959 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-14 14:38:10,975 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-14 14:38:11,175 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,SelfDestructingSolverStorable11 [2022-04-14 14:38:11,175 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:38:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:38:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1140068703, now seen corresponding path program 1 times [2022-04-14 14:38:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:38:11,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185129145] [2022-04-14 14:38:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:38:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:38:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:38:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:11,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {6106#(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; {6091#true} is VALID [2022-04-14 14:38:11,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6091#true} {6091#true} #81#return; {6091#true} is VALID [2022-04-14 14:38:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:38:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:11,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:11,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:11,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6091#true} {6097#(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))} #79#return; {6097#(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-14 14:38:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:38:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:11,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:11,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:11,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6091#true} {6092#false} #79#return; {6092#false} is VALID [2022-04-14 14:38:11,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6106#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:38:11,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {6106#(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; {6091#true} is VALID [2022-04-14 14:38:11,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6091#true} {6091#true} #81#return; {6091#true} is VALID [2022-04-14 14:38:11,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {6091#true} call #t~ret5 := main(); {6091#true} is VALID [2022-04-14 14:38:11,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {6091#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6096#(= main_~l~0 0)} is VALID [2022-04-14 14:38:11,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {6096#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6096#(= main_~l~0 0)} is VALID [2022-04-14 14:38:11,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {6096#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6096#(= main_~l~0 0)} is VALID [2022-04-14 14:38:11,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {6096#(= main_~l~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; {6096#(= main_~l~0 0)} is VALID [2022-04-14 14:38:11,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {6096#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {6097#(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-14 14:38:11,276 INFO L272 TraceCheckUtils]: 10: Hoare triple {6097#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6091#true} is VALID [2022-04-14 14:38:11,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:11,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:11,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,277 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6091#true} {6097#(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))} #79#return; {6097#(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-14 14:38:11,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {6097#(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); {6097#(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-14 14:38:11,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {6097#(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); {6097#(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-14 14:38:11,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {6097#(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); {6097#(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-14 14:38:11,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {6097#(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; {6092#false} is VALID [2022-04-14 14:38:11,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {6092#false} ~l~0 := 1 + ~l~0; {6092#false} is VALID [2022-04-14 14:38:11,280 INFO L272 TraceCheckUtils]: 20: Hoare triple {6092#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6091#true} is VALID [2022-04-14 14:38:11,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:11,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:11,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,280 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6091#true} {6092#false} #79#return; {6092#false} is VALID [2022-04-14 14:38:11,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {6092#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {6092#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); {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {6092#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); {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {6092#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); {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {6092#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); {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {6092#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; {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {6092#false} ~l~0 := 1 + ~l~0; {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L272 TraceCheckUtils]: 32: Hoare triple {6092#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-14 14:38:11,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-14 14:38:11,281 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-14 14:38:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:38:11,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185129145] [2022-04-14 14:38:11,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185129145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:38:11,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144455448] [2022-04-14 14:38:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:38:11,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:38:11,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:38:11,282 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-14 14:38:11,283 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-14 14:38:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:11,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:38:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:11,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:38:11,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-14 14:38:11,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#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; {6091#true} is VALID [2022-04-14 14:38:11,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6091#true} {6091#true} #81#return; {6091#true} is VALID [2022-04-14 14:38:11,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {6091#true} call #t~ret5 := main(); {6091#true} is VALID [2022-04-14 14:38:11,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {6091#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6125#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:11,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {6125#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6125#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:11,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {6125#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6125#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:11,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {6125#(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) (= 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; {6135#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:11,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {6135#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6139#(and (= 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-14 14:38:11,954 INFO L272 TraceCheckUtils]: 10: Hoare triple {6139#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6091#true} is VALID [2022-04-14 14:38:11,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:11,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:11,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,955 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6091#true} {6139#(and (= 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))} #79#return; {6139#(and (= 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-14 14:38:11,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {6139#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6139#(and (= 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-14 14:38:11,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {6139#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6139#(and (= 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-14 14:38:11,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {6139#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6139#(and (= 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-14 14:38:11,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {6139#(and (= 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))} 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; {6167#(and (= 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 1))} is VALID [2022-04-14 14:38:11,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {6167#(and (= 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 1))} ~l~0 := 1 + ~l~0; {6171#(and (= 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-14 14:38:11,957 INFO L272 TraceCheckUtils]: 20: Hoare triple {6171#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6091#true} is VALID [2022-04-14 14:38:11,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:11,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:11,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:11,958 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6091#true} {6171#(and (= 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))} #79#return; {6171#(and (= 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-14 14:38:11,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {6171#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6171#(and (= 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-14 14:38:11,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {6171#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6171#(and (= 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-14 14:38:11,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {6171#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6171#(and (= 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-14 14:38:11,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {6171#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6171#(and (= 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-14 14:38:11,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {6171#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {6171#(and (= 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-14 14:38:11,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {6171#(and (= 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))} 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; {6205#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:38:11,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {6205#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {6209#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:38:11,961 INFO L272 TraceCheckUtils]: 32: Hoare triple {6209#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6213#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:38:11,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {6213#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6217#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:38:11,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {6217#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6092#false} is VALID [2022-04-14 14:38:11,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-14 14:38:11,962 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-14 14:38:11,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:38:12,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-14 14:38:12,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {6217#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6092#false} is VALID [2022-04-14 14:38:12,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {6213#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6217#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:38:12,272 INFO L272 TraceCheckUtils]: 32: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6213#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:38:12,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {6237#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,387 WARN L290 TraceCheckUtils]: 30: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {6237#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:38:14,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,390 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6091#true} {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:14,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:14,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:14,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:14,390 INFO L272 TraceCheckUtils]: 20: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6091#true} is VALID [2022-04-14 14:38:14,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {6237#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:16,498 WARN L290 TraceCheckUtils]: 18: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {6237#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:38:16,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:16,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:16,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:16,500 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6091#true} {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:16,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:16,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-14 14:38:16,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-14 14:38:16,501 INFO L272 TraceCheckUtils]: 10: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6091#true} is VALID [2022-04-14 14:38:16,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {6237#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:18,605 WARN L290 TraceCheckUtils]: 8: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {6237#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:38:18,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:18,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:18,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {6091#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6233#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:18,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {6091#true} call #t~ret5 := main(); {6091#true} is VALID [2022-04-14 14:38:18,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6091#true} {6091#true} #81#return; {6091#true} is VALID [2022-04-14 14:38:18,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-14 14:38:18,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#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; {6091#true} is VALID [2022-04-14 14:38:18,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-14 14:38:18,608 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-14 14:38:18,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144455448] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:38:18,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:38:18,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:38:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200801825] [2022-04-14 14:38:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:38:18,609 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-14 14:38:18,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:38:18,609 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-14 14:38:24,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 22 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:38:24,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:38:24,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:38:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:38:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:38:24,948 INFO L87 Difference]: Start difference. First operand 112 states and 150 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-14 14:38:27,053 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-14 14:38:29,220 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-14 14:38:31,395 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-14 14:38:33,514 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-14 14:38:35,726 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-14 14:38:37,891 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-14 14:38:40,037 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-14 14:38:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:40,227 INFO L93 Difference]: Finished difference Result 138 states and 186 transitions. [2022-04-14 14:38:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:38:40,227 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-14 14:38:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:38:40,227 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-14 14:38:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:38:40,228 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-14 14:38:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:38:40,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:38:46,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 44 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:38:46,601 INFO L225 Difference]: With dead ends: 138 [2022-04-14 14:38:46,601 INFO L226 Difference]: Without dead ends: 136 [2022-04-14 14:38:46,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 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-14 14:38:46,601 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:38:46,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 15.0s Time] [2022-04-14 14:38:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-14 14:38:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-04-14 14:38:46,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:38:46,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 125 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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-14 14:38:46,665 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 125 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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-14 14:38:46,665 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 125 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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-14 14:38:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:46,667 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2022-04-14 14:38:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2022-04-14 14:38:46,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:38:46,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:38:46,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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 136 states. [2022-04-14 14:38:46,668 INFO L87 Difference]: Start difference. First operand has 125 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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 136 states. [2022-04-14 14:38:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:46,670 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2022-04-14 14:38:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2022-04-14 14:38:46,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:38:46,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:38:46,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:38:46,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:38:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 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-14 14:38:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2022-04-14 14:38:46,672 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 36 [2022-04-14 14:38:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:38:46,672 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions. [2022-04-14 14:38:46,672 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-14 14:38:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2022-04-14 14:38:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 14:38:46,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:38:46,673 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-14 14:38:46,690 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-14 14:38:46,887 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,SelfDestructingSolverStorable12 [2022-04-14 14:38:46,887 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:38:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:38:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1085631520, now seen corresponding path program 1 times [2022-04-14 14:38:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:38:46,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645055389] [2022-04-14 14:38:46,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:38:46,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:38:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:38:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:46,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {6958#(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; {6943#true} is VALID [2022-04-14 14:38:46,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:46,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6943#true} {6943#true} #81#return; {6943#true} is VALID [2022-04-14 14:38:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:38:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:46,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:46,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:46,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:46,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-14 14:38:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:46,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:46,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:46,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:46,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #79#return; {6944#false} is VALID [2022-04-14 14:38:46,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {6943#true} call ULTIMATE.init(); {6958#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:38:46,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#(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; {6943#true} is VALID [2022-04-14 14:38:46,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:46,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #81#return; {6943#true} is VALID [2022-04-14 14:38:46,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {6943#true} call #t~ret5 := main(); {6943#true} is VALID [2022-04-14 14:38:46,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {6943#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6948#(= main_~l~0 0)} is VALID [2022-04-14 14:38:46,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {6948#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6948#(= main_~l~0 0)} is VALID [2022-04-14 14:38:46,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {6948#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6948#(= main_~l~0 0)} is VALID [2022-04-14 14:38:46,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {6948#(= main_~l~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; {6948#(= main_~l~0 0)} is VALID [2022-04-14 14:38:46,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {6948#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,948 INFO L272 TraceCheckUtils]: 10: Hoare triple {6949#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6943#true} is VALID [2022-04-14 14:38:46,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:46,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:46,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:46,948 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6943#true} {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {6949#(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); {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {6949#(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); {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {6949#(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); {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {6949#(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); {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {6949#(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); {6949#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {6949#(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; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {6944#false} ~l~0 := 1 + ~l~0; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L272 TraceCheckUtils]: 23: Hoare triple {6944#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6943#true} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:46,951 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6943#true} {6944#false} #79#return; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {6944#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {6944#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); {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {6944#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;~v2~0 := 1 + ~v2~0; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {6944#false} ~l~0 := 1 + ~l~0; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L272 TraceCheckUtils]: 32: Hoare triple {6944#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {6944#false} assume 0 == ~cond; {6944#false} is VALID [2022-04-14 14:38:46,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {6944#false} assume !false; {6944#false} is VALID [2022-04-14 14:38:46,951 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-14 14:38:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:38:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645055389] [2022-04-14 14:38:46,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645055389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:38:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318214607] [2022-04-14 14:38:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:38:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:38:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:38:46,967 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-14 14:38:46,968 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-14 14:38:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:47,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:38:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:47,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:38:47,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {6943#true} call ULTIMATE.init(); {6943#true} is VALID [2022-04-14 14:38:47,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#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; {6943#true} is VALID [2022-04-14 14:38:47,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:47,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #81#return; {6943#true} is VALID [2022-04-14 14:38:47,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {6943#true} call #t~ret5 := main(); {6943#true} is VALID [2022-04-14 14:38:47,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {6943#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6977#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {6977#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6977#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {6977#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6977#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {6977#(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) (= 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; {6987#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {6987#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6991#(and (= 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-14 14:38:47,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {6991#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6943#true} is VALID [2022-04-14 14:38:47,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:47,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:47,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:47,605 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6943#true} {6991#(and (= 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))} #79#return; {6991#(and (= 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-14 14:38:47,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {6991#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6991#(and (= 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-14 14:38:47,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {6991#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6991#(and (= 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-14 14:38:47,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {6991#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6991#(and (= 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-14 14:38:47,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {6991#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6991#(and (= 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-14 14:38:47,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {6991#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {6991#(and (= 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-14 14:38:47,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {6991#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {6991#(and (= 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-14 14:38:47,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {6991#(and (= 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))} 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; {7028#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {7028#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,608 INFO L272 TraceCheckUtils]: 23: Hoare triple {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6943#true} is VALID [2022-04-14 14:38:47,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:47,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:47,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:47,609 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6943#true} {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {7032#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {7057#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v1~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {7057#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v1~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7061#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:47,611 INFO L272 TraceCheckUtils]: 32: Hoare triple {7061#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:38:47,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {7065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:38:47,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {7069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6944#false} is VALID [2022-04-14 14:38:47,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {6944#false} assume !false; {6944#false} is VALID [2022-04-14 14:38:47,612 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-14 14:38:47,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:38:47,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {6944#false} assume !false; {6944#false} is VALID [2022-04-14 14:38:47,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {7069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6944#false} is VALID [2022-04-14 14:38:47,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {7065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:38:47,880 INFO L272 TraceCheckUtils]: 32: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:38:47,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {7089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:49,985 WARN L290 TraceCheckUtils]: 30: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {7089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:38:49,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:49,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:49,990 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6943#true} {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:49,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:49,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:49,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:49,990 INFO L272 TraceCheckUtils]: 23: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6943#true} is VALID [2022-04-14 14:38:49,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {7089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {7089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:38:50,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,012 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6943#true} {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:50,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:50,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-04-14 14:38:50,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-04-14 14:38:50,012 INFO L272 TraceCheckUtils]: 10: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6943#true} is VALID [2022-04-14 14:38:50,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {7089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:52,128 WARN L290 TraceCheckUtils]: 8: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {7089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:38:52,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:52,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:52,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {6943#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:38:52,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {6943#true} call #t~ret5 := main(); {6943#true} is VALID [2022-04-14 14:38:52,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #81#return; {6943#true} is VALID [2022-04-14 14:38:52,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-04-14 14:38:52,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#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; {6943#true} is VALID [2022-04-14 14:38:52,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {6943#true} call ULTIMATE.init(); {6943#true} is VALID [2022-04-14 14:38:52,145 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-14 14:38:52,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318214607] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:38:52,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:38:52,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:38:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065353702] [2022-04-14 14:38:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:38:52,145 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-14 14:38:52,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:38:52,146 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-14 14:38:56,389 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-14 14:38:56,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:38:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:38:56,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:38:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:38:56,390 INFO L87 Difference]: Start difference. First operand 125 states and 169 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-14 14:38:58,427 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-14 14:39:00,608 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-14 14:39:02,775 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-14 14:39:04,955 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-14 14:39:07,075 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-14 14:39:09,338 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-14 14:39:11,508 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-14 14:39:13,618 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-14 14:39:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:15,969 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2022-04-14 14:39:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:39:15,969 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-14 14:39:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:39:15,969 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-14 14:39:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:39:15,970 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-14 14:39:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:39:15,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:39:20,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 47 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:39:20,333 INFO L225 Difference]: With dead ends: 152 [2022-04-14 14:39:20,333 INFO L226 Difference]: Without dead ends: 150 [2022-04-14 14:39:20,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 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-14 14:39:20,334 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:39:20,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 8 Unknown, 0 Unchecked, 17.1s Time] [2022-04-14 14:39:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-14 14:39:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2022-04-14 14:39:20,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:39:20,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 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-14 14:39:20,397 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 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-14 14:39:20,397 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 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-14 14:39:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:20,399 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2022-04-14 14:39:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2022-04-14 14:39:20,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:20,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:20,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 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 150 states. [2022-04-14 14:39:20,400 INFO L87 Difference]: Start difference. First operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 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 150 states. [2022-04-14 14:39:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:20,402 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2022-04-14 14:39:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2022-04-14 14:39:20,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:20,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:20,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:39:20,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:39:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 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-14 14:39:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2022-04-14 14:39:20,404 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 36 [2022-04-14 14:39:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:39:20,404 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2022-04-14 14:39:20,404 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-14 14:39:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2022-04-14 14:39:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 14:39:20,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:39:20,405 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-14 14:39:20,437 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-14 14:39:20,623 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,SelfDestructingSolverStorable13 [2022-04-14 14:39:20,625 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:39:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:39:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1673001268, now seen corresponding path program 1 times [2022-04-14 14:39:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:39:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134354405] [2022-04-14 14:39:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:39:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:39:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:20,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {7870#(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; {7855#true} is VALID [2022-04-14 14:39:20,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:20,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7855#true} {7855#true} #81#return; {7855#true} is VALID [2022-04-14 14:39:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:39:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:20,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:20,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:20,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:20,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7855#true} {7861#(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))} #79#return; {7861#(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-14 14:39:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:39:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:20,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:20,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:20,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:20,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7855#true} {7856#false} #79#return; {7856#false} is VALID [2022-04-14 14:39:20,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {7855#true} call ULTIMATE.init(); {7870#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:39:20,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {7870#(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; {7855#true} is VALID [2022-04-14 14:39:20,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:20,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7855#true} {7855#true} #81#return; {7855#true} is VALID [2022-04-14 14:39:20,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {7855#true} call #t~ret5 := main(); {7855#true} is VALID [2022-04-14 14:39:20,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {7855#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7860#(= main_~l~0 0)} is VALID [2022-04-14 14:39:20,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {7860#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7860#(= main_~l~0 0)} is VALID [2022-04-14 14:39:20,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {7860#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7860#(= main_~l~0 0)} is VALID [2022-04-14 14:39:20,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {7860#(= main_~l~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; {7860#(= main_~l~0 0)} is VALID [2022-04-14 14:39:20,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {7860#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {7861#(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-14 14:39:20,732 INFO L272 TraceCheckUtils]: 10: Hoare triple {7861#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7855#true} is VALID [2022-04-14 14:39:20,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:20,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:20,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:20,733 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7855#true} {7861#(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))} #79#return; {7861#(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-14 14:39:20,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {7861#(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); {7861#(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-14 14:39:20,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {7861#(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); {7861#(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-14 14:39:20,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {7861#(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); {7861#(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-14 14:39:20,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {7861#(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; {7856#false} is VALID [2022-04-14 14:39:20,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {7856#false} ~l~0 := 1 + ~l~0; {7856#false} is VALID [2022-04-14 14:39:20,736 INFO L272 TraceCheckUtils]: 20: Hoare triple {7856#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7855#true} is VALID [2022-04-14 14:39:20,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:20,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:20,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:20,736 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7855#true} {7856#false} #79#return; {7856#false} is VALID [2022-04-14 14:39:20,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {7856#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {7856#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); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {7856#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); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {7856#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); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {7856#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); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {7856#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); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {7856#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; {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {7856#false} ~l~0 := 1 + ~l~0; {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L272 TraceCheckUtils]: 33: Hoare triple {7856#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {7856#false} ~cond := #in~cond; {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {7856#false} assume 0 == ~cond; {7856#false} is VALID [2022-04-14 14:39:20,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {7856#false} assume !false; {7856#false} is VALID [2022-04-14 14:39:20,737 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-14 14:39:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:39:20,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134354405] [2022-04-14 14:39:20,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134354405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:39:20,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462724100] [2022-04-14 14:39:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:20,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:39:20,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:39:20,738 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-14 14:39:20,739 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-14 14:39:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:20,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:39:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:20,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:39:21,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {7855#true} call ULTIMATE.init(); {7855#true} is VALID [2022-04-14 14:39:21,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {7855#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; {7855#true} is VALID [2022-04-14 14:39:21,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:21,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7855#true} {7855#true} #81#return; {7855#true} is VALID [2022-04-14 14:39:21,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {7855#true} call #t~ret5 := main(); {7855#true} is VALID [2022-04-14 14:39:21,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {7855#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7889#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {7889#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7889#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {7889#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7889#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {7889#(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) (= 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; {7899#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {7899#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,516 INFO L272 TraceCheckUtils]: 10: Hoare triple {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7855#true} is VALID [2022-04-14 14:39:21,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:21,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:21,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:21,521 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7855#true} {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:21,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {7903#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {7931#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {7931#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,523 INFO L272 TraceCheckUtils]: 20: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7855#true} is VALID [2022-04-14 14:39:21,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:21,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:21,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:21,523 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7855#true} {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} #79#return; {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:39:21,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {7935#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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; {7972#(and (= (+ (- 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 1))} is VALID [2022-04-14 14:39:21,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {7972#(and (= (+ (- 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 1))} ~l~0 := 1 + ~l~0; {7976#(and (= (+ (- 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 1))} is VALID [2022-04-14 14:39:21,528 INFO L272 TraceCheckUtils]: 33: Hoare triple {7976#(and (= (+ (- 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 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:21,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {7980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:21,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {7984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7856#false} is VALID [2022-04-14 14:39:21,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {7856#false} assume !false; {7856#false} is VALID [2022-04-14 14:39:21,528 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-14 14:39:21,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:39:21,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {7856#false} assume !false; {7856#false} is VALID [2022-04-14 14:39:21,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {7984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7856#false} is VALID [2022-04-14 14:39:21,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {7980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:21,830 INFO L272 TraceCheckUtils]: 33: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:21,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {8004#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {8004#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:39:21,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,845 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7855#true} {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:21,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:21,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:21,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:21,845 INFO L272 TraceCheckUtils]: 20: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7855#true} is VALID [2022-04-14 14:39:21,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {8004#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:23,953 WARN L290 TraceCheckUtils]: 18: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {8004#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:39:23,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:23,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:23,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:23,955 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7855#true} {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:23,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:23,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {7855#true} assume !(0 == ~cond); {7855#true} is VALID [2022-04-14 14:39:23,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {7855#true} ~cond := #in~cond; {7855#true} is VALID [2022-04-14 14:39:23,955 INFO L272 TraceCheckUtils]: 10: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7855#true} is VALID [2022-04-14 14:39:23,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {8004#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:26,067 WARN L290 TraceCheckUtils]: 8: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {8004#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:39:26,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:26,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:26,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {7855#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8000#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:26,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {7855#true} call #t~ret5 := main(); {7855#true} is VALID [2022-04-14 14:39:26,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7855#true} {7855#true} #81#return; {7855#true} is VALID [2022-04-14 14:39:26,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {7855#true} assume true; {7855#true} is VALID [2022-04-14 14:39:26,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {7855#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; {7855#true} is VALID [2022-04-14 14:39:26,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {7855#true} call ULTIMATE.init(); {7855#true} is VALID [2022-04-14 14:39:26,071 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-14 14:39:26,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462724100] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:39:26,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:39:26,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:39:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504706230] [2022-04-14 14:39:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:39:26,072 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-14 14:39:26,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:39:26,072 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-14 14:39:30,358 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-14 14:39:30,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:39:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:39:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:39:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:39:30,359 INFO L87 Difference]: Start difference. First operand 137 states and 186 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-14 14:39:32,399 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-14 14:39:34,582 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-14 14:39:36,755 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-14 14:39:43,190 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-14 14:39:45,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:47,587 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-14 14:39:51,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:52,102 INFO L93 Difference]: Finished difference Result 164 states and 224 transitions. [2022-04-14 14:39:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:39:52,102 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-14 14:39:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:39:52,102 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-14 14:39:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:39:52,103 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-14 14:39:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:39:52,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:39:58,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 46 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:39:58,557 INFO L225 Difference]: With dead ends: 164 [2022-04-14 14:39:58,558 INFO L226 Difference]: Without dead ends: 162 [2022-04-14 14:39:58,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 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-14 14:39:58,558 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-04-14 14:39:58,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 14.8s Time] [2022-04-14 14:39:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-14 14:39:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2022-04-14 14:39:58,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:39:58,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 109 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 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-14 14:39:58,608 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 109 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 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-14 14:39:58,608 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 109 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 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-14 14:39:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:58,610 INFO L93 Difference]: Finished difference Result 162 states and 222 transitions. [2022-04-14 14:39:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 222 transitions. [2022-04-14 14:39:58,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:58,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:58,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 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 162 states. [2022-04-14 14:39:58,611 INFO L87 Difference]: Start difference. First operand has 109 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 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 162 states. [2022-04-14 14:39:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:58,613 INFO L93 Difference]: Finished difference Result 162 states and 222 transitions. [2022-04-14 14:39:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 222 transitions. [2022-04-14 14:39:58,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:58,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:58,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:39:58,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:39:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 89 states have internal predecessors, (132), 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-14 14:39:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2022-04-14 14:39:58,615 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 37 [2022-04-14 14:39:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:39:58,615 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2022-04-14 14:39:58,615 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-14 14:39:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2022-04-14 14:39:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 14:39:58,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:39:58,616 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:39:58,635 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-14 14:39:58,824 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,SelfDestructingSolverStorable14 [2022-04-14 14:39:58,824 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:39:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:39:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash 449249813, now seen corresponding path program 1 times [2022-04-14 14:39:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:39:58,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849203205] [2022-04-14 14:39:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:39:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:39:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:58,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {8790#(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; {8775#true} is VALID [2022-04-14 14:39:58,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:58,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8775#true} {8775#true} #81#return; {8775#true} is VALID [2022-04-14 14:39:58,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:39:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:58,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:58,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:58,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:58,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-14 14:39:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:58,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:58,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:58,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:58,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8776#false} #79#return; {8776#false} is VALID [2022-04-14 14:39:58,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8790#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:39:58,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {8790#(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; {8775#true} is VALID [2022-04-14 14:39:58,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:58,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #81#return; {8775#true} is VALID [2022-04-14 14:39:58,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-14 14:39:58,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8780#(= main_~l~0 0)} is VALID [2022-04-14 14:39:58,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {8780#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8780#(= main_~l~0 0)} is VALID [2022-04-14 14:39:58,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {8780#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8780#(= main_~l~0 0)} is VALID [2022-04-14 14:39:58,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {8780#(= main_~l~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; {8780#(= main_~l~0 0)} is VALID [2022-04-14 14:39:58,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {8780#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,880 INFO L272 TraceCheckUtils]: 10: Hoare triple {8781#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8775#true} is VALID [2022-04-14 14:39:58,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:58,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:58,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:58,880 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8775#true} {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {8781#(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); {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {8781#(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); {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {8781#(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); {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {8781#(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); {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {8781#(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); {8781#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {8781#(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; {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {8776#false} ~l~0 := 1 + ~l~0; {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L272 TraceCheckUtils]: 23: Hoare triple {8776#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8775#true} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:58,883 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8775#true} {8776#false} #79#return; {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {8776#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {8776#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); {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {8776#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); {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {8776#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); {8776#false} is VALID [2022-04-14 14:39:58,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {8776#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); {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {8776#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; {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {8776#false} ~l~0 := 1 + ~l~0; {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L272 TraceCheckUtils]: 35: Hoare triple {8776#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-14 14:39:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:39:58,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:39:58,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849203205] [2022-04-14 14:39:58,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849203205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:39:58,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510974298] [2022-04-14 14:39:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:58,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:39:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:39:58,887 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-14 14:39:58,888 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-14 14:39:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:58,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:39:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:58,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:39:59,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2022-04-14 14:39:59,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#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; {8775#true} is VALID [2022-04-14 14:39:59,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:59,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #81#return; {8775#true} is VALID [2022-04-14 14:39:59,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-14 14:39:59,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8809#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {8809#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8809#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {8809#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8809#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {8809#(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) (= 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; {8819#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {8819#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8823#(and (= 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-14 14:39:59,551 INFO L272 TraceCheckUtils]: 10: Hoare triple {8823#(and (= 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))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8775#true} is VALID [2022-04-14 14:39:59,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:59,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:59,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:59,552 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8775#true} {8823#(and (= 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))} #79#return; {8823#(and (= 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-14 14:39:59,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {8823#(and (= 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))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8823#(and (= 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-14 14:39:59,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {8823#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8823#(and (= 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-14 14:39:59,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {8823#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8823#(and (= 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-14 14:39:59,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {8823#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8823#(and (= 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-14 14:39:59,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {8823#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {8823#(and (= 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-14 14:39:59,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {8823#(and (= 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))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {8823#(and (= 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-14 14:39:59,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {8823#(and (= 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))} 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; {8860#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {8860#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,556 INFO L272 TraceCheckUtils]: 23: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8775#true} is VALID [2022-04-14 14:39:59,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:59,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:59,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:59,556 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8775#true} {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {8864#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {8898#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {8898#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8902#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:59,560 INFO L272 TraceCheckUtils]: 35: Hoare triple {8902#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 1) (= main_~v4~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:59,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {8906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:59,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {8910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8776#false} is VALID [2022-04-14 14:39:59,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-14 14:39:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:39:59,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:39:59,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-14 14:39:59,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {8910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8776#false} is VALID [2022-04-14 14:39:59,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {8906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:59,878 INFO L272 TraceCheckUtils]: 35: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:59,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {8930#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {8930#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:39:59,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,883 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8775#true} {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:59,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:59,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:59,884 INFO L272 TraceCheckUtils]: 23: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8775#true} is VALID [2022-04-14 14:39:59,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {8930#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {8930#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:39:59,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,894 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8775#true} {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:39:59,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:39:59,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {8775#true} assume !(0 == ~cond); {8775#true} is VALID [2022-04-14 14:39:59,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {8775#true} ~cond := #in~cond; {8775#true} is VALID [2022-04-14 14:39:59,894 INFO L272 TraceCheckUtils]: 10: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8775#true} is VALID [2022-04-14 14:39:59,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {8930#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:02,017 WARN L290 TraceCheckUtils]: 8: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {8930#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:40:02,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:02,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:02,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8926#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:02,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-14 14:40:02,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #81#return; {8775#true} is VALID [2022-04-14 14:40:02,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-14 14:40:02,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#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; {8775#true} is VALID [2022-04-14 14:40:02,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2022-04-14 14:40:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-14 14:40:02,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510974298] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:40:02,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:40:02,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:40:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233073103] [2022-04-14 14:40:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:40:02,020 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 39 [2022-04-14 14:40:02,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:40:02,020 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-14 14:40:06,289 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-14 14:40:06,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:40:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:40:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:40:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:40:06,290 INFO L87 Difference]: Start difference. First operand 109 states and 151 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-14 14:40:08,348 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-14 14:40:10,467 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-14 14:40:12,634 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-14 14:40:14,799 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-14 14:40:16,965 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-14 14:40:19,075 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-14 14:40:23,334 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-14 14:40:25,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-14 14:40:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:40:25,909 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2022-04-14 14:40:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:40:25,909 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 39 [2022-04-14 14:40:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:40:25,909 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-14 14:40:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:40:25,910 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-14 14:40:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:40:25,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:40:32,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 46 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:40:32,327 INFO L225 Difference]: With dead ends: 137 [2022-04-14 14:40:32,327 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 14:40:32,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 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-14 14:40:32,328 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-04-14 14:40:32,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 8 Unknown, 0 Unchecked, 17.2s Time] [2022-04-14 14:40:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 14:40:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2022-04-14 14:40:32,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:40:32,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:40:32,375 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:40:32,376 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:40:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:40:32,377 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2022-04-14 14:40:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 189 transitions. [2022-04-14 14:40:32,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:40:32,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:40:32,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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 135 states. [2022-04-14 14:40:32,378 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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 135 states. [2022-04-14 14:40:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:40:32,380 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2022-04-14 14:40:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 189 transitions. [2022-04-14 14:40:32,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:40:32,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:40:32,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:40:32,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:40:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:40:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2022-04-14 14:40:32,381 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 39 [2022-04-14 14:40:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:40:32,381 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2022-04-14 14:40:32,382 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-14 14:40:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2022-04-14 14:40:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 14:40:32,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:40:32,382 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, 1] [2022-04-14 14:40:32,400 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-14 14:40:32,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:40:32,598 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:40:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:40:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1003504260, now seen corresponding path program 1 times [2022-04-14 14:40:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:40:32,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857045503] [2022-04-14 14:40:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:40:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:40:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:40:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {9641#(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; {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:40:32,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:40:32,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {9619#true} #81#return; {9624#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:40:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:40:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:32,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:32,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:32,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9619#true} {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:40:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:40:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:32,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:32,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:32,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9619#true} {9620#false} #79#return; {9620#false} is VALID [2022-04-14 14:40:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-14 14:40:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:32,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:32,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:32,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9619#true} {9620#false} #79#return; {9620#false} is VALID [2022-04-14 14:40:32,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {9619#true} call ULTIMATE.init(); {9641#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:40:32,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {9641#(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; {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:40:32,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:40:32,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9642#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {9619#true} #81#return; {9624#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:40:32,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {9624#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {9624#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:40:32,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {9624#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9625#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:40:32,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {9625#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9626#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:40:32,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {9626#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9626#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:40:32,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {9626#(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 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {9626#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:40:32,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {9626#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:40:32,808 INFO L272 TraceCheckUtils]: 10: Hoare triple {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:32,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:32,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:32,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:32,809 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9619#true} {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:40:32,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {9627#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9632#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:40:32,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {9632#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) 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); {9632#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:40:32,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {9632#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9632#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {9632#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {9620#false} ~l~0 := 1 + ~l~0; {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L272 TraceCheckUtils]: 20: Hoare triple {9620#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:32,813 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9619#true} {9620#false} #79#return; {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {9620#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {9620#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); {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {9620#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); {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {9620#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); {9620#false} is VALID [2022-04-14 14:40:32,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {9620#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); {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {9620#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; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {9620#false} ~l~0 := 1 + ~l~0; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L272 TraceCheckUtils]: 32: Hoare triple {9620#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:32,814 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9619#true} {9620#false} #79#return; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {9620#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {9620#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); {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {9620#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;~v2~0 := 1 + ~v2~0; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {9620#false} ~l~0 := 1 + ~l~0; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L272 TraceCheckUtils]: 41: Hoare triple {9620#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {9620#false} ~cond := #in~cond; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {9620#false} assume 0 == ~cond; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {9620#false} assume !false; {9620#false} is VALID [2022-04-14 14:40:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-14 14:40:32,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:40:32,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857045503] [2022-04-14 14:40:32,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857045503] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:40:32,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012266273] [2022-04-14 14:40:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:40:32,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:40:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:40:32,818 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-14 14:40:32,819 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-14 14:40:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:40:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:32,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:40:33,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {9619#true} call ULTIMATE.init(); {9619#true} is VALID [2022-04-14 14:40:33,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {9619#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; {9619#true} is VALID [2022-04-14 14:40:33,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:33,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9619#true} {9619#true} #81#return; {9619#true} is VALID [2022-04-14 14:40:33,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {9619#true} call #t~ret5 := main(); {9619#true} is VALID [2022-04-14 14:40:33,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {9619#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9661#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {9661#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9661#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {9661#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9661#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {9661#(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) (= 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; {9671#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {9671#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,640 INFO L272 TraceCheckUtils]: 10: Hoare triple {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:33,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:33,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:33,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:33,641 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9619#true} {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:33,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {9675#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {9703#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {9703#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,643 INFO L272 TraceCheckUtils]: 20: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:33,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:33,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:33,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:33,643 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9619#true} {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} #79#return; {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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); {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {9707#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= 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; {9741#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {9741#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,646 INFO L272 TraceCheckUtils]: 32: Hoare triple {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:33,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:33,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:33,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:33,647 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9619#true} {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} #79#return; {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~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); {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {9745#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~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;~v2~0 := 1 + ~v2~0; {9770#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {9770#(and (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {9774#(and (= main_~l~0 4) (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:40:33,649 INFO L272 TraceCheckUtils]: 41: Hoare triple {9774#(and (= main_~l~0 4) (= main_~k~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:40:33,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {9778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:40:33,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {9782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9620#false} is VALID [2022-04-14 14:40:33,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {9620#false} assume !false; {9620#false} is VALID [2022-04-14 14:40:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 14:40:33,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:40:34,036 INFO L290 TraceCheckUtils]: 44: Hoare triple {9620#false} assume !false; {9620#false} is VALID [2022-04-14 14:40:34,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {9782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9620#false} is VALID [2022-04-14 14:40:34,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {9778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:40:34,038 INFO L272 TraceCheckUtils]: 41: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:40:34,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:36,159 WARN L290 TraceCheckUtils]: 39: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:40:36,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:36,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:36,160 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9619#true} {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:36,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:36,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:36,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:36,161 INFO L272 TraceCheckUtils]: 32: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:36,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,277 WARN L290 TraceCheckUtils]: 30: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:40:38,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,280 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9619#true} {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:38,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:38,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:38,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:38,280 INFO L272 TraceCheckUtils]: 20: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:38,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:40,394 WARN L290 TraceCheckUtils]: 18: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:40:40,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:40,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:40,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:40,396 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9619#true} {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:40,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:40,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {9619#true} assume !(0 == ~cond); {9619#true} is VALID [2022-04-14 14:40:40,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {9619#true} ~cond := #in~cond; {9619#true} is VALID [2022-04-14 14:40:40,396 INFO L272 TraceCheckUtils]: 10: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9619#true} is VALID [2022-04-14 14:40:40,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:42,534 WARN L290 TraceCheckUtils]: 8: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {9802#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:40:42,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:42,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:42,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {9619#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9798#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:40:42,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {9619#true} call #t~ret5 := main(); {9619#true} is VALID [2022-04-14 14:40:42,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9619#true} {9619#true} #81#return; {9619#true} is VALID [2022-04-14 14:40:42,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {9619#true} assume true; {9619#true} is VALID [2022-04-14 14:40:42,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {9619#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; {9619#true} is VALID [2022-04-14 14:40:42,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {9619#true} call ULTIMATE.init(); {9619#true} is VALID [2022-04-14 14:40:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-14 14:40:42,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012266273] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:40:42,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:40:42,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 13] total 22 [2022-04-14 14:40:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268329003] [2022-04-14 14:40:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:40:42,536 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 45 [2022-04-14 14:40:42,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:40:42,537 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-14 14:40:51,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 22 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-14 14:40:51,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:40:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:40:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:40:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-14 14:40:51,018 INFO L87 Difference]: Start difference. First operand 111 states and 155 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-14 14:40:53,129 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-14 14:40:55,293 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-14 14:40:57,484 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-14 14:40:59,767 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-14 14:41:04,100 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-14 14:41:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:04,269 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2022-04-14 14:41:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:41:04,269 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 45 [2022-04-14 14:41:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:41:04,269 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-14 14:41:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:41:04,270 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-14 14:41:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:41:04,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:41:12,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 43 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-14 14:41:12,763 INFO L225 Difference]: With dead ends: 161 [2022-04-14 14:41:12,763 INFO L226 Difference]: Without dead ends: 159 [2022-04-14 14:41:12,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-14 14:41:12,764 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:41:12,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-14 14:41:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-14 14:41:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 111. [2022-04-14 14:41:12,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:41:12,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:41:12,810 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:41:12,810 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:41:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:12,812 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2022-04-14 14:41:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 223 transitions. [2022-04-14 14:41:12,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:41:12,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:41:12,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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 159 states. [2022-04-14 14:41:12,812 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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 159 states. [2022-04-14 14:41:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:12,814 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2022-04-14 14:41:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 223 transitions. [2022-04-14 14:41:12,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:41:12,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:41:12,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:41:12,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:41:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 91 states have internal predecessors, (136), 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-14 14:41:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2022-04-14 14:41:12,818 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 45 [2022-04-14 14:41:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:41:12,818 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2022-04-14 14:41:12,818 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-14 14:41:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2022-04-14 14:41:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-14 14:41:12,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:41:12,819 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:41:12,837 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-14 14:41:13,035 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,SelfDestructingSolverStorable16 [2022-04-14 14:41:13,035 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:41:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:41:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2004991630, now seen corresponding path program 1 times [2022-04-14 14:41:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:41:13,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316435566] [2022-04-14 14:41:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:41:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:41:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:41:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {10606#(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; {10587#true} is VALID [2022-04-14 14:41:13,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10587#true} {10587#true} #81#return; {10587#true} is VALID [2022-04-14 14:41:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:41:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10587#true} {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-14 14:41:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10587#true} {10588#false} #79#return; {10588#false} is VALID [2022-04-14 14:41:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-14 14:41:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10587#true} {10588#false} #79#return; {10588#false} is VALID [2022-04-14 14:41:13,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {10587#true} call ULTIMATE.init(); {10606#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:41:13,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {10606#(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; {10587#true} is VALID [2022-04-14 14:41:13,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10587#true} {10587#true} #81#return; {10587#true} is VALID [2022-04-14 14:41:13,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {10587#true} call #t~ret5 := main(); {10587#true} is VALID [2022-04-14 14:41:13,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {10587#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10592#(= main_~l~0 0)} is VALID [2022-04-14 14:41:13,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {10592#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10592#(= main_~l~0 0)} is VALID [2022-04-14 14:41:13,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {10592#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10592#(= main_~l~0 0)} is VALID [2022-04-14 14:41:13,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {10592#(= main_~l~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; {10592#(= main_~l~0 0)} is VALID [2022-04-14 14:41:13,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {10592#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,131 INFO L272 TraceCheckUtils]: 10: Hoare triple {10593#(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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:13,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,132 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10587#true} {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #79#return; {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {10593#(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); {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {10593#(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); {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {10593#(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); {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {10593#(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); {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {10593#(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); {10593#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:41:13,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {10593#(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; {10588#false} is VALID [2022-04-14 14:41:13,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {10588#false} ~l~0 := 1 + ~l~0; {10588#false} is VALID [2022-04-14 14:41:13,134 INFO L272 TraceCheckUtils]: 23: Hoare triple {10588#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:13,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,135 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10587#true} {10588#false} #79#return; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {10588#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {10588#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); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {10588#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); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {10588#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); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {10588#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); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {10588#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; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {10588#false} ~l~0 := 1 + ~l~0; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L272 TraceCheckUtils]: 35: Hoare triple {10588#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,135 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10587#true} {10588#false} #79#return; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {10588#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {10588#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); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {10588#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;~v2~0 := 1 + ~v2~0; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {10588#false} ~l~0 := 1 + ~l~0; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L272 TraceCheckUtils]: 44: Hoare triple {10588#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {10588#false} ~cond := #in~cond; {10588#false} is VALID [2022-04-14 14:41:13,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {10588#false} assume 0 == ~cond; {10588#false} is VALID [2022-04-14 14:41:13,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {10588#false} assume !false; {10588#false} is VALID [2022-04-14 14:41:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-14 14:41:13,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:41:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316435566] [2022-04-14 14:41:13,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316435566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:41:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270385208] [2022-04-14 14:41:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:41:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:41:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:41:13,137 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-14 14:41:13,138 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-14 14:41:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:41:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:13,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:41:13,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {10587#true} call ULTIMATE.init(); {10587#true} is VALID [2022-04-14 14:41:13,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#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; {10587#true} is VALID [2022-04-14 14:41:13,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10587#true} {10587#true} #81#return; {10587#true} is VALID [2022-04-14 14:41:13,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {10587#true} call #t~ret5 := main(); {10587#true} is VALID [2022-04-14 14:41:13,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {10587#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10625#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {10625#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10625#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {10625#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10625#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {10625#(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) (= 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; {10635#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {10635#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,987 INFO L272 TraceCheckUtils]: 10: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:13,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,988 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10587#true} {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {10639#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {10676#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {10676#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,991 INFO L272 TraceCheckUtils]: 23: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:13,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,992 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10587#true} {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {10680#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {10714#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {10714#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,995 INFO L272 TraceCheckUtils]: 35: Hoare triple {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:13,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:13,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:13,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:13,996 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10587#true} {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} #79#return; {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~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); {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {10718#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {10743#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v1~0 1) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {10743#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v1~0 1) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10747#(and (= main_~l~0 4) (= main_~j~0 1) (= main_~k~0 0) (= main_~v1~0 1) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:13,998 INFO L272 TraceCheckUtils]: 44: Hoare triple {10747#(and (= main_~l~0 4) (= main_~j~0 1) (= main_~k~0 0) (= main_~v1~0 1) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:41:13,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {10751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:41:13,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {10755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10588#false} is VALID [2022-04-14 14:41:13,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {10588#false} assume !false; {10588#false} is VALID [2022-04-14 14:41:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 14:41:13,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:41:14,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {10588#false} assume !false; {10588#false} is VALID [2022-04-14 14:41:14,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {10755#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10588#false} is VALID [2022-04-14 14:41:14,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {10751#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:41:14,373 INFO L272 TraceCheckUtils]: 44: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:41:14,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:16,487 WARN L290 TraceCheckUtils]: 42: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:41:16,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:16,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:16,489 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10587#true} {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:16,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:16,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:16,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:16,489 INFO L272 TraceCheckUtils]: 35: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:16,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,594 WARN L290 TraceCheckUtils]: 33: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:41:18,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,596 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10587#true} {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:18,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:18,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:18,597 INFO L272 TraceCheckUtils]: 23: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:18,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:41:18,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,637 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10587#true} {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:18,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:18,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {10587#true} assume !(0 == ~cond); {10587#true} is VALID [2022-04-14 14:41:18,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {10587#true} ~cond := #in~cond; {10587#true} is VALID [2022-04-14 14:41:18,638 INFO L272 TraceCheckUtils]: 10: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10587#true} is VALID [2022-04-14 14:41:18,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:20,739 WARN L290 TraceCheckUtils]: 8: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {10775#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:41:20,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:20,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:20,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {10587#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10771#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:20,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {10587#true} call #t~ret5 := main(); {10587#true} is VALID [2022-04-14 14:41:20,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10587#true} {10587#true} #81#return; {10587#true} is VALID [2022-04-14 14:41:20,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {10587#true} assume true; {10587#true} is VALID [2022-04-14 14:41:20,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#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; {10587#true} is VALID [2022-04-14 14:41:20,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {10587#true} call ULTIMATE.init(); {10587#true} is VALID [2022-04-14 14:41:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-14 14:41:20,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270385208] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:41:20,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:41:20,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 13] total 18 [2022-04-14 14:41:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556363782] [2022-04-14 14:41:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:41:20,743 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 48 [2022-04-14 14:41:20,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:41:20,744 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-14 14:41:27,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 24 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:41:27,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:41:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:41:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:41:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:41:27,121 INFO L87 Difference]: Start difference. First operand 111 states and 155 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-14 14:41:29,223 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-14 14:41:31,388 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-14 14:41:33,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-14 14:41:35,669 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-14 14:41:37,789 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-14 14:41:39,906 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-14 14:41:42,133 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-14 14:41:44,419 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-14 14:41:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:46,752 INFO L93 Difference]: Finished difference Result 213 states and 301 transitions. [2022-04-14 14:41:46,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:41:46,753 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 48 [2022-04-14 14:41:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:41:46,753 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-14 14:41:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:41:46,753 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-14 14:41:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:41:46,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:41:53,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 46 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:41:53,236 INFO L225 Difference]: With dead ends: 213 [2022-04-14 14:41:53,236 INFO L226 Difference]: Without dead ends: 211 [2022-04-14 14:41:53,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:41:53,236 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:41:53,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 8 Unknown, 0 Unchecked, 17.0s Time] [2022-04-14 14:41:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-14 14:41:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-04-14 14:41:53,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:41:53,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 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-14 14:41:53,333 INFO L74 IsIncluded]: Start isIncluded. First operand 211 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-14 14:41:53,334 INFO L87 Difference]: Start difference. First operand 211 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-14 14:41:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:53,337 INFO L93 Difference]: Finished difference Result 211 states and 299 transitions. [2022-04-14 14:41:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2022-04-14 14:41:53,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:41:53,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:41:53,337 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 211 states. [2022-04-14 14:41:53,337 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 211 states. [2022-04-14 14:41:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:53,340 INFO L93 Difference]: Finished difference Result 211 states and 299 transitions. [2022-04-14 14:41:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2022-04-14 14:41:53,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:41:53,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:41:53,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:41:53,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:41:53,341 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-14 14:41:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2022-04-14 14:41:53,343 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 48 [2022-04-14 14:41:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:41:53,344 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2022-04-14 14:41:53,344 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-14 14:41:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2022-04-14 14:41:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 14:41:53,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:41:53,345 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:41:53,363 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-14 14:41:53,560 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,SelfDestructingSolverStorable17 [2022-04-14 14:41:53,561 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:41:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:41:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1169047643, now seen corresponding path program 1 times [2022-04-14 14:41:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:41:53,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907184379] [2022-04-14 14:41:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:41:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:41:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:41:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {11887#(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; {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:53,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:53,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {11861#true} #81#return; {11866#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:53,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:41:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11861#true} {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:53,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:41:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11861#true} {11862#false} #79#return; {11862#false} is VALID [2022-04-14 14:41:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-14 14:41:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11861#true} {11862#false} #79#return; {11862#false} is VALID [2022-04-14 14:41:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-14 14:41:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11861#true} {11862#false} #79#return; {11862#false} is VALID [2022-04-14 14:41:53,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {11861#true} call ULTIMATE.init(); {11887#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:41:53,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {11887#(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; {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:53,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:53,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11888#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {11861#true} #81#return; {11866#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:53,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {11866#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {11866#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:53,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {11866#(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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11867#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:53,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {11867#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {11868#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:53,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {11868#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11868#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:53,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {11868#(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 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {11868#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:53,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {11868#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:53,810 INFO L272 TraceCheckUtils]: 10: Hoare triple {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:53,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,811 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11861#true} {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} #79#return; {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:53,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {11869#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= (+ 1053741824 main_~n~0) (+ (* 1073741825 main_~l~0) (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11874#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:41:53,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {11874#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) 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); {11874#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:41:53,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {11874#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {11874#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {11874#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {11862#false} ~l~0 := 1 + ~l~0; {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L272 TraceCheckUtils]: 20: Hoare triple {11862#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11861#true} {11862#false} #79#return; {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {11862#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {11862#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; {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {11862#false} ~l~0 := 1 + ~l~0; {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L272 TraceCheckUtils]: 33: Hoare triple {11862#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,816 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11861#true} {11862#false} #79#return; {11862#false} is VALID [2022-04-14 14:41:53,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {11862#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {11862#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; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {11862#false} ~l~0 := 1 + ~l~0; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L272 TraceCheckUtils]: 45: Hoare triple {11862#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:53,817 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11861#true} {11862#false} #79#return; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {11862#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {11862#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); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {11862#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;~v2~0 := 1 + ~v2~0; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {11862#false} ~l~0 := 1 + ~l~0; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L272 TraceCheckUtils]: 54: Hoare triple {11862#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {11862#false} ~cond := #in~cond; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {11862#false} assume 0 == ~cond; {11862#false} is VALID [2022-04-14 14:41:53,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {11862#false} assume !false; {11862#false} is VALID [2022-04-14 14:41:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-14 14:41:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:41:53,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907184379] [2022-04-14 14:41:53,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907184379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:41:53,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220152234] [2022-04-14 14:41:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:41:53,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:41:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:41:53,819 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-14 14:41:53,820 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-14 14:41:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-14 14:41:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:53,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:41:54,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {11861#true} call ULTIMATE.init(); {11861#true} is VALID [2022-04-14 14:41:54,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#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; {11861#true} is VALID [2022-04-14 14:41:54,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:54,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11861#true} {11861#true} #81#return; {11861#true} is VALID [2022-04-14 14:41:54,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {11861#true} call #t~ret5 := main(); {11861#true} is VALID [2022-04-14 14:41:54,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {11861#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11907#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {11907#(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) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {11907#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {11907#(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) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11907#(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) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {11907#(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) (= 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; {11917#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {11917#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,929 INFO L272 TraceCheckUtils]: 10: Hoare triple {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= 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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:54,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:54,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:54,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:54,929 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11861#true} {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #79#return; {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:54,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {11921#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {11949#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {11949#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,931 INFO L272 TraceCheckUtils]: 20: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:54,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:54,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:54,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:54,932 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11861#true} {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} #79#return; {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {11953#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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; {11990#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {11990#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,935 INFO L272 TraceCheckUtils]: 33: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:54,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:54,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:54,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:54,936 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11861#true} {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} #79#return; {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 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); {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 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); {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 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); {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 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); {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {11994#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 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; {12028#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:41:54,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {12028#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1) (= 2 (+ (- 1) main_~l~0)))} ~l~0 := 1 + ~l~0; {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,939 INFO L272 TraceCheckUtils]: 45: Hoare triple {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:54,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:54,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:54,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:54,939 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11861#true} {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} #79#return; {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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); {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {12032#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~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;~v2~0 := 1 + ~v2~0; {12057#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {12057#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= (+ (- 2) main_~l~0) 2) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {12061#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= 5 main_~l~0) (= main_~v3~0 1))} is VALID [2022-04-14 14:41:54,942 INFO L272 TraceCheckUtils]: 54: Hoare triple {12061#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= 5 main_~l~0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:41:54,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {12065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:41:54,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {12069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11862#false} is VALID [2022-04-14 14:41:54,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {11862#false} assume !false; {11862#false} is VALID [2022-04-14 14:41:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 14:41:54,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:41:55,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {11862#false} assume !false; {11862#false} is VALID [2022-04-14 14:41:55,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {12069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11862#false} is VALID [2022-04-14 14:41:55,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {12065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:41:55,440 INFO L272 TraceCheckUtils]: 54: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:41:55,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:57,551 WARN L290 TraceCheckUtils]: 52: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:41:57,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:57,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:57,553 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11861#true} {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:57,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:57,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:57,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:57,553 INFO L272 TraceCheckUtils]: 45: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:57,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,668 WARN L290 TraceCheckUtils]: 43: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:41:59,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,671 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11861#true} {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:59,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:59,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:59,671 INFO L272 TraceCheckUtils]: 33: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:59,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:41:59,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,699 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11861#true} {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:41:59,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:41:59,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:41:59,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:41:59,700 INFO L272 TraceCheckUtils]: 20: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:41:59,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:01,818 WARN L290 TraceCheckUtils]: 18: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:42:01,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:01,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:01,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:01,820 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11861#true} {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #79#return; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:01,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:42:01,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {11861#true} assume !(0 == ~cond); {11861#true} is VALID [2022-04-14 14:42:01,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {11861#true} ~cond := #in~cond; {11861#true} is VALID [2022-04-14 14:42:01,820 INFO L272 TraceCheckUtils]: 10: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11861#true} is VALID [2022-04-14 14:42:01,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:03,932 WARN L290 TraceCheckUtils]: 8: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~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; {12089#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:42:03,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:03,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:03,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {11861#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12085#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:42:03,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {11861#true} call #t~ret5 := main(); {11861#true} is VALID [2022-04-14 14:42:03,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11861#true} {11861#true} #81#return; {11861#true} is VALID [2022-04-14 14:42:03,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {11861#true} assume true; {11861#true} is VALID [2022-04-14 14:42:03,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {11861#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; {11861#true} is VALID [2022-04-14 14:42:03,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {11861#true} call ULTIMATE.init(); {11861#true} is VALID [2022-04-14 14:42:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-14 14:42:03,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220152234] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:42:03,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:42:03,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 15] total 24 [2022-04-14 14:42:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795465246] [2022-04-14 14:42:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:42:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 58 [2022-04-14 14:42:03,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:42:03,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-14 14:42:12,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 24 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-14 14:42:12,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:42:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:42:12,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:42:12,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2022-04-14 14:42:12,434 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-14 14:42:14,533 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-14 14:42:16,705 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-14 14:42:18,894 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-14 14:42:21,123 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-14 14:42:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:21,502 INFO L93 Difference]: Finished difference Result 211 states and 299 transitions. [2022-04-14 14:42:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:42:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 58 [2022-04-14 14:42:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:42:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-14 14:42:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-14 14:42:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-14 14:42:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-14 14:42:21,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-14 14:42:29,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 24 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-14 14:42:30,000 INFO L225 Difference]: With dead ends: 211 [2022-04-14 14:42:30,000 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 14:42:30,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-04-14 14:42:30,001 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-14 14:42:30,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 36 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-04-14 14:42:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 14:42:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 14:42:30,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:42:30,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:42:30,002 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:42:30,002 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:42:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:30,002 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:42:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:42:30,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:30,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:42:30,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 14:42:30,002 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 14:42:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:30,002 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:42:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:42:30,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:30,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:42:30,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:42:30,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:42:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:42:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 14:42:30,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-04-14 14:42:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:42:30,003 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 14:42:30,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-14 14:42:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:42:30,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:30,005 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 14:42:30,028 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-14 14:42:30,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:42:30,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L33-2(lines 23 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 41) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 36) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point L21-2(lines 21 39) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 41) no Hoare annotation was computed. [2022-04-14 14:42:30,448 INFO L878 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))) [2022-04-14 14:42:30,449 INFO L878 garLoopResultBuilder]: At program point L38-1(lines 21 39) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))) [2022-04-14 14:42:30,449 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 41) the Hoare annotation is: true [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-14 14:42:30,449 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-14 14:42:30,449 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-14 14:42:30,451 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:42:30,452 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 14:42:30,454 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 14:42:30,454 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:42:30,455 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 14:42:30,455 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-14 14:42:30,456 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-14 14:42:30,457 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-14 14:42:30,457 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 14:42:30,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:42:30 BoogieIcfgContainer [2022-04-14 14:42:30,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 14:42:30,469 INFO L158 Benchmark]: Toolchain (without parser) took 725830.75ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 139.5MB in the end (delta: -11.3MB). Peak memory consumption was 77.3MB. Max. memory is 8.0GB. [2022-04-14 14:42:30,469 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 14:42:30,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.26ms. Allocated memory is still 179.3MB. Free memory was 128.0MB in the beginning and 156.4MB in the end (delta: -28.4MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-14 14:42:30,469 INFO L158 Benchmark]: Boogie Preprocessor took 18.84ms. Allocated memory is still 179.3MB. Free memory was 156.4MB in the beginning and 154.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 14:42:30,469 INFO L158 Benchmark]: RCFGBuilder took 8932.09ms. Allocated memory is still 179.3MB. Free memory was 154.7MB in the beginning and 142.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 14:42:30,470 INFO L158 Benchmark]: TraceAbstraction took 716717.30ms. Allocated memory is still 179.3MB. Free memory was 141.7MB in the beginning and 139.5MB in the end (delta: 2.2MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2022-04-14 14:42:30,470 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 159.26ms. Allocated memory is still 179.3MB. Free memory was 128.0MB in the beginning and 156.4MB in the end (delta: -28.4MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.84ms. Allocated memory is still 179.3MB. Free memory was 156.4MB in the beginning and 154.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8932.09ms. Allocated memory is still 179.3MB. Free memory was 154.7MB in the beginning and 142.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 716717.30ms. Allocated memory is still 179.3MB. Free memory was 141.7MB in the beginning and 139.5MB in the end (delta: 2.2MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 716.7s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 525.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 159 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 335.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 1115 SdHoareTripleChecker+Invalid, 320.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 823 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1114 IncrementalHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 292 mSDtfsCounter, 1114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 1029 SyntacticMatches, 69 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=18, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 221 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 24 PreInvPairs, 29 NumberOfFragments, 66 HoareAnnotationTreeSize, 24 FomulaSimplifications, 1000 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1133 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 99.7s InterpolantComputationTime, 1195 NumberOfCodeBlocks, 1195 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1725 ConstructedInterpolants, 0 QuantifiedInterpolants, 17482 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1995 ConjunctsInSsa, 519 ConjunctsInUnsatCore, 53 InterpolantComputations, 19 PerfectInterpolantSequences, 869/1161 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(20000001 <= SIZE) || !(SIZE <= 20000001)) || (i + k + j + v3 + v2 + v1 + v4) % 4294967296 == l % 4294967296 RESULT: Ultimate proved your program to be correct! [2022-04-14 14:42:30,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...