/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/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:30:06,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:30:06,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:30:06,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:30:06,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:30:06,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:30:06,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:30:06,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:30:06,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:30:06,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:30:06,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:30:06,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:30:06,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:30:06,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:30:06,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:30:06,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:30:06,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:30:06,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:30:06,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:30:06,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:30:06,316 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:30:06,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:30:06,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:30:06,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:30:06,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:30:06,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:30:06,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:30:06,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:30:06,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:30:06,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:30:06,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:30:06,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:30:06,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:30:06,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:30:06,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:30:06,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:30:06,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:30:06,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:30:06,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:30:06,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:30:06,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:30:06,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:30:06,337 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:06,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:30:06,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:30:06,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:30:06,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:30:06,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:30:06,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:30:06,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:30:06,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:30:06,366 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:30:06,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:30:06,367 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:30:06,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:30:06,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:30:06,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:30:06,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:30:06,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:30:06,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:30:06,369 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:30:06,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:30:06,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:30:06,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:30:06,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:30:06,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:30:06,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:30:06,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:30:06,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:30:06,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:30:06,371 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:06,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:30:06,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:30:06,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:30:06,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:30:06,634 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:30:06,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-14 14:30:06,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9ea32a0/d723c2af3dbc43899dcf366193c0bc70/FLAGcdfa056bd [2022-04-14 14:30:07,096 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:30:07,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-14 14:30:07,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9ea32a0/d723c2af3dbc43899dcf366193c0bc70/FLAGcdfa056bd [2022-04-14 14:30:07,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9ea32a0/d723c2af3dbc43899dcf366193c0bc70 [2022-04-14 14:30:07,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:30:07,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:30:07,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:30:07,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:30:07,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:30:07,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:30:07" (1/1) ... [2022-04-14 14:30:07,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fff0ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:07, skipping insertion in model container [2022-04-14 14:30:07,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:30:07" (1/1) ... [2022-04-14 14:30:07,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:30:07,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:30:07,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-14 14:30:07,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:30:07,735 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:30:07,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-14 14:30:07,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:30:07,768 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:30:07,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:07 WrapperNode [2022-04-14 14:30:07,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:30:07,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:30:07,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:30:07,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:30:07,780 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:07" (1/1) ... [2022-04-14 14:30:07,780 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:07" (1/1) ... [2022-04-14 14:30:07,786 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:07" (1/1) ... [2022-04-14 14:30:07,786 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:07" (1/1) ... [2022-04-14 14:30:07,792 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:07" (1/1) ... [2022-04-14 14:30:07,796 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:07" (1/1) ... [2022-04-14 14:30:07,797 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:07" (1/1) ... [2022-04-14 14:30:07,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:30:07,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:30:07,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:30:07,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:30:07,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:07" (1/1) ... [2022-04-14 14:30:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:30:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:30:07,857 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:07,869 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:07,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:30:07,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:30:07,907 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:30:07,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:30:07,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:30:07,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 14:30:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:30:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:30:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:30:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:30:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:30:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:30:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:30:07,976 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:30:07,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:30:14,666 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:30:14,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:30:14,674 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 14:30:14,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:30:14 BoogieIcfgContainer [2022-04-14 14:30:14,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:30:14,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:30:14,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:30:14,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:30:14,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:30:07" (1/3) ... [2022-04-14 14:30:14,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a20e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:30:14, skipping insertion in model container [2022-04-14 14:30:14,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:30:07" (2/3) ... [2022-04-14 14:30:14,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697a20e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:30:14, skipping insertion in model container [2022-04-14 14:30:14,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:30:14" (3/3) ... [2022-04-14 14:30:14,685 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-04-14 14:30:14,690 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:30:14,690 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:30:14,734 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:30:14,739 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:14,739 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:30:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:30:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 14:30:14,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:30:14,763 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:30:14,763 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:30:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:30:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-04-14 14:30:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:30:14,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319547931] [2022-04-14 14:30:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:30:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:30:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:30:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:14,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-14 14:30:14,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-14 14:30:14,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-14 14:30:14,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:30:14,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-14 14:30:14,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-14 14:30:14,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-14 14:30:14,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2022-04-14 14:30:14,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {29#true} is VALID [2022-04-14 14:30:14,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {29#true} is VALID [2022-04-14 14:30:14,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-14 14:30:15,000 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-14 14:30:15,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-14 14:30:15,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-14 14:30:15,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-14 14:30:15,001 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:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:30:15,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319547931] [2022-04-14 14:30:15,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319547931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:30:15,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:30:15,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 14:30:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380815203] [2022-04-14 14:30:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:30:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 14:30:15,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:30:15,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:15,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:30:15,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 14:30:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:30:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 14:30:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:30:15,064 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:30:21,697 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 14:30:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 14:30:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 14:30:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:30:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-14 14:30:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-14 14:30:21,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-14 14:30:21,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:30:21,779 INFO L225 Difference]: With dead ends: 38 [2022-04-14 14:30:21,779 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 14:30:21,782 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:30:21,785 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:30:21,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:30:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 14:30:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 14:30:21,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:30:21,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,813 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,814 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:30:21,822 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-14 14:30:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-14 14:30:21,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:30:21,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:30:21,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-14 14:30:21,824 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-14 14:30:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:30:21,829 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-14 14:30:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-14 14:30:21,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:30:21,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:30:21,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:30:21,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:30:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-14 14:30:21,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-14 14:30:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:30:21,834 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-14 14:30:21,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-14 14:30:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 14:30:21,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:30:21,836 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:30:21,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 14:30:21,836 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:30:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:30:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-04-14 14:30:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:30:21,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781628763] [2022-04-14 14:30:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:30:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:30:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:30:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:22,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(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; {148#true} is VALID [2022-04-14 14:30:22,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2022-04-14 14:30:22,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #76#return; {148#true} is VALID [2022-04-14 14:30:22,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:30:22,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(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; {148#true} is VALID [2022-04-14 14:30:22,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume true; {148#true} is VALID [2022-04-14 14:30:22,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} #76#return; {148#true} is VALID [2022-04-14 14:30:22,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {148#true} call #t~ret5 := main(); {148#true} is VALID [2022-04-14 14:30:22,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:22,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:22,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:22,197 INFO L272 TraceCheckUtils]: 8: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {154#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:30:22,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {155#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:30:22,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {149#false} is VALID [2022-04-14 14:30:22,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-04-14 14:30:22,198 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:22,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:30:22,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781628763] [2022-04-14 14:30:22,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781628763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:30:22,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:30:22,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 14:30:22,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098718398] [2022-04-14 14:30:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:30:22,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 14:30:22,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:30:22,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:22,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:30:22,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:30:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:30:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:30:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 14:30:22,216 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:24,377 WARN L534 Checker$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:30,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:30:37,451 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:30:39,607 WARN L534 Checker$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:41,766 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:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:30:41,987 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-14 14:30:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:30:41,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 14:30:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:30:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-14 14:30:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-14 14:30:41,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-14 14:30:42,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:30:42,047 INFO L225 Difference]: With dead ends: 26 [2022-04-14 14:30:42,047 INFO L226 Difference]: Without dead ends: 21 [2022-04-14 14:30:42,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:30:42,048 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:30:42,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-14 14:30:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-14 14:30:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-14 14:30:42,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:30:42,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:42,053 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:42,053 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:30:42,055 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-14 14:30:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-14 14:30:42,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:30:42,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:30:42,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-14 14:30:42,057 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-14 14:30:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:30:42,058 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-14 14:30:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-14 14:30:42,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:30:42,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:30:42,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:30:42,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:30:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-14 14:30:42,061 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-14 14:30:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:30:42,061 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-14 14:30:42,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-14 14:30:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 14:30:42,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:30:42,063 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:30:42,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 14:30:42,064 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:30:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:30:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-04-14 14:30:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:30:42,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550454774] [2022-04-14 14:30:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:30:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:30:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:30:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:42,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#(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; {271#true} is VALID [2022-04-14 14:30:42,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-14 14:30:42,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-14 14:30:42,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:30:42,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(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; {271#true} is VALID [2022-04-14 14:30:42,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-14 14:30:42,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-14 14:30:42,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret5 := main(); {271#true} is VALID [2022-04-14 14:30:42,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:42,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:42,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:42,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:42,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:42,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:42,865 INFO L272 TraceCheckUtils]: 11: Hoare triple {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:30:42,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:30:42,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {272#false} is VALID [2022-04-14 14:30:42,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-04-14 14:30:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:30:42,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:30:42,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550454774] [2022-04-14 14:30:42,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550454774] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:30:42,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835609853] [2022-04-14 14:30:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:30:42,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:30:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:30:42,872 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:30:42,873 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:30:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:42,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-14 14:30:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:30:42,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:30:43,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2022-04-14 14:30:43,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#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; {271#true} is VALID [2022-04-14 14:30:43,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-14 14:30:43,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-14 14:30:43,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret5 := main(); {271#true} is VALID [2022-04-14 14:30:43,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:43,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:43,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:43,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:43,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:43,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:30:43,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:30:43,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:30:43,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {272#false} is VALID [2022-04-14 14:30:43,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-04-14 14:30:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:30:43,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:30:43,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} assume !false; {272#false} is VALID [2022-04-14 14:30:43,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {272#false} is VALID [2022-04-14 14:30:43,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:30:43,728 INFO L272 TraceCheckUtils]: 11: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:30:43,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:30:43,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:30:45,849 WARN L290 TraceCheckUtils]: 8: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:30:45,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:30:45,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:30:45,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:30:45,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret5 := main(); {271#true} is VALID [2022-04-14 14:30:45,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #76#return; {271#true} is VALID [2022-04-14 14:30:45,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2022-04-14 14:30:45,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#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; {271#true} is VALID [2022-04-14 14:30:45,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2022-04-14 14:30:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 14:30:45,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835609853] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:30:45,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:30:45,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-14 14:30:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325909192] [2022-04-14 14:30:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:30:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:30:45,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:30:45,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:48,002 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:30:48,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:30:48,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:30:48,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:30:48,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:30:48,004 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:30:50,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:30:58,763 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:09,675 WARN L534 Checker$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:11,856 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:31:14,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:14,211 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-14 14:31:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:31:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:31:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:31:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-14 14:31:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-14 14:31:14,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-14 14:31:16,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:16,359 INFO L225 Difference]: With dead ends: 28 [2022-04-14 14:31:16,359 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 14:31:16,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:31:16,361 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:31:16,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-04-14 14:31:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 14:31:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-14 14:31:16,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:31:16,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:16,368 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:16,368 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:16,370 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-14 14:31:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 14:31:16,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:16,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:16,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-14 14:31:16,371 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-14 14:31:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:16,372 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-14 14:31:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 14:31:16,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:16,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:16,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:31:16,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:31:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-14 14:31:16,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-14 14:31:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:31:16,375 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-14 14:31:16,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-14 14:31:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 14:31:16,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:31:16,376 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:31:16,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 14:31:16,603 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:31:16,604 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:31:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:31:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-04-14 14:31:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:31:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931299364] [2022-04-14 14:31:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:31:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:16,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:31:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:16,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(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; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:16,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:16,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} #76#return; {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:16,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:31:16,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#(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; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:16,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:16,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} #76#return; {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:16,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:16,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:16,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {503#(= main_~l~0 0)} is VALID [2022-04-14 14:31:16,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {503#(= main_~l~0 0)} is VALID [2022-04-14 14:31:16,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {497#false} is VALID [2022-04-14 14:31:16,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {497#false} is VALID [2022-04-14 14:31:16,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#false} ~l~0 := 1 + ~l~0; {497#false} is VALID [2022-04-14 14:31:16,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {497#false} is VALID [2022-04-14 14:31:16,992 INFO L272 TraceCheckUtils]: 12: Hoare triple {497#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {497#false} is VALID [2022-04-14 14:31:16,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#false} ~cond := #in~cond; {497#false} is VALID [2022-04-14 14:31:16,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#false} assume 0 == ~cond; {497#false} is VALID [2022-04-14 14:31:16,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {497#false} assume !false; {497#false} is VALID [2022-04-14 14:31:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:31:16,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:31:16,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931299364] [2022-04-14 14:31:16,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931299364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:31:16,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:31:16,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 14:31:16,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700127809] [2022-04-14 14:31:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:31:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-14 14:31:16,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:31:16,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:19,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:19,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 14:31:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:31:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 14:31:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-14 14:31:19,181 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:23,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:31:27,833 WARN L534 Checker$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:32,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:32,447 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-14 14:31:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:31:32,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-14 14:31:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:31:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 14:31:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 14:31:32,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-14 14:31:34,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:34,668 INFO L225 Difference]: With dead ends: 37 [2022-04-14 14:31:34,669 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 14:31:34,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:31:34,670 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:31:34,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-14 14:31:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 14:31:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-14 14:31:34,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:31:34,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,688 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,688 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:34,689 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-14 14:31:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-14 14:31:34,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:34,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:34,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-14 14:31:34,691 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-14 14:31:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:31:34,692 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-14 14:31:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-14 14:31:34,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:31:34,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:31:34,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:31:34,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:31:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-14 14:31:34,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-14 14:31:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:31:34,695 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-14 14:31:34,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-14 14:31:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 14:31:34,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:31:34,696 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:31:34,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 14:31:34,696 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:31:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:31:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 57783349, now seen corresponding path program 1 times [2022-04-14 14:31:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:31:34,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422973065] [2022-04-14 14:31:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:31:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:31:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:35,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(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; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:35,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:35,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} #76#return; {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:35,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:31:35,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(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; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:35,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:31:35,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} #76#return; {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:35,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:35,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:31:35,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {651#(= main_~l~0 0)} is VALID [2022-04-14 14:31:35,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {651#(= main_~l~0 0)} is VALID [2022-04-14 14:31:35,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {651#(= main_~l~0 0)} is VALID [2022-04-14 14:31:35,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {652#(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:31:35,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {652#(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); {652#(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:31:35,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(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); {652#(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:31:35,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(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; {645#false} is VALID [2022-04-14 14:31:35,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#false} ~l~0 := 1 + ~l~0; {645#false} is VALID [2022-04-14 14:31:35,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {645#false} is VALID [2022-04-14 14:31:35,022 INFO L272 TraceCheckUtils]: 15: Hoare triple {645#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {645#false} is VALID [2022-04-14 14:31:35,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2022-04-14 14:31:35,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {645#false} assume 0 == ~cond; {645#false} is VALID [2022-04-14 14:31:35,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-14 14:31:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:31:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:31:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422973065] [2022-04-14 14:31:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422973065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:31:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573644134] [2022-04-14 14:31:35,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:31:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:31:35,028 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:31:35,032 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:31:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:35,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 14:31:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:35,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:31:35,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2022-04-14 14:31:35,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#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; {644#true} is VALID [2022-04-14 14:31:35,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-14 14:31:35,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #76#return; {644#true} is VALID [2022-04-14 14:31:35,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret5 := main(); {644#true} is VALID [2022-04-14 14:31:35,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:35,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:31:35,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-14 14:31:35,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-14 14:31:35,607 INFO L272 TraceCheckUtils]: 15: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:31:35,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:31:35,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {645#false} is VALID [2022-04-14 14:31:35,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-14 14:31:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:31:35,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:31:35,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-04-14 14:31:35,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {645#false} is VALID [2022-04-14 14:31:35,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:31:35,903 INFO L272 TraceCheckUtils]: 15: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:31:35,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:35,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:35,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:31:35,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:35,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:35,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:38,049 WARN L290 TraceCheckUtils]: 8: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:31:38,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:38,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:38,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:31:38,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret5 := main(); {644#true} is VALID [2022-04-14 14:31:38,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #76#return; {644#true} is VALID [2022-04-14 14:31:38,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2022-04-14 14:31:38,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#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; {644#true} is VALID [2022-04-14 14:31:38,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2022-04-14 14:31:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 14:31:38,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573644134] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:31:38,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:31:38,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-14 14:31:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515723718] [2022-04-14 14:31:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:31:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-14 14:31:38,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:31:38,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:42,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:42,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:31:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:31:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:31:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:31:42,342 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:44,428 WARN L534 Checker$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:46,597 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:31:53,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:59,597 WARN L534 Checker$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,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:01,986 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-14 14:32:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:32:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-14 14:32:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:32:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-14 14:32:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-14 14:32:01,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-14 14:32:06,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:06,264 INFO L225 Difference]: With dead ends: 33 [2022-04-14 14:32:06,264 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 14:32:06,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:32:06,265 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-14 14:32:06,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 10.7s Time] [2022-04-14 14:32:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 14:32:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-14 14:32:06,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:32:06,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:06,277 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:06,278 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:06,279 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-14 14:32:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-14 14:32:06,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:06,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:06,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-14 14:32:06,280 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-14 14:32:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:06,281 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-14 14:32:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-14 14:32:06,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:06,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:06,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:32:06,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:32:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-14 14:32:06,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-14 14:32:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:32:06,283 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-14 14:32:06,283 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-14 14:32:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 14:32:06,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:32:06,284 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:32:06,303 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:32:06,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:06,496 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:32:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:32:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2070632639, now seen corresponding path program 1 times [2022-04-14 14:32:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:32:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987174295] [2022-04-14 14:32:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:32:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:32:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:06,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(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; {914#true} is VALID [2022-04-14 14:32:06,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-14 14:32:06,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-14 14:32:06,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:32:06,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(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; {914#true} is VALID [2022-04-14 14:32:06,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-14 14:32:06,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-14 14:32:06,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2022-04-14 14:32:06,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {919#(= main_~l~0 0)} is VALID [2022-04-14 14:32:06,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {919#(= main_~l~0 0)} is VALID [2022-04-14 14:32:06,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {919#(= main_~l~0 0)} is VALID [2022-04-14 14:32:06,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {919#(= main_~l~0 0)} is VALID [2022-04-14 14:32:06,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:32:06,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:32:06,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(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); {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:32:06,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {920#(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); {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:32:06,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(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; {915#false} is VALID [2022-04-14 14:32:06,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#false} ~l~0 := 1 + ~l~0; {915#false} is VALID [2022-04-14 14:32:06,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {915#false} is VALID [2022-04-14 14:32:06,602 INFO L272 TraceCheckUtils]: 16: Hoare triple {915#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {915#false} is VALID [2022-04-14 14:32:06,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {915#false} ~cond := #in~cond; {915#false} is VALID [2022-04-14 14:32:06,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#false} assume 0 == ~cond; {915#false} is VALID [2022-04-14 14:32:06,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-14 14:32:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:06,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:32:06,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987174295] [2022-04-14 14:32:06,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987174295] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:06,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579980294] [2022-04-14 14:32:06,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:06,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:06,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:32:06,608 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:32:06,650 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:32:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:06,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 14:32:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:06,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:32:07,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2022-04-14 14:32:07,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#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; {914#true} is VALID [2022-04-14 14:32:07,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-14 14:32:07,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-14 14:32:07,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2022-04-14 14:32:07,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:07,194 INFO L272 TraceCheckUtils]: 16: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:07,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:07,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {915#false} is VALID [2022-04-14 14:32:07,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-14 14:32:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:07,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:32:07,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-14 14:32:07,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {915#false} is VALID [2022-04-14 14:32:07,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:07,486 INFO L272 TraceCheckUtils]: 16: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:07,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:07,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:07,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:32:07,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:07,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:07,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:07,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:09,646 WARN L290 TraceCheckUtils]: 8: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:32:09,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:09,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:09,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:09,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} call #t~ret5 := main(); {914#true} is VALID [2022-04-14 14:32:09,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} #76#return; {914#true} is VALID [2022-04-14 14:32:09,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} assume true; {914#true} is VALID [2022-04-14 14:32:09,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#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; {914#true} is VALID [2022-04-14 14:32:09,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2022-04-14 14:32:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 14:32:09,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579980294] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:09,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:32:09,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:32:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092595353] [2022-04-14 14:32:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:32:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 14:32:09,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:32:09,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:09,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:09,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:32:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:32:09,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:32:09,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:32:09,696 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:11,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:13,933 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:32:16,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:18,267 WARN L534 Checker$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,380 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:32:22,509 WARN L534 Checker$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:24,710 WARN L534 Checker$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:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:24,905 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 14:32:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:32:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 14:32:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:32:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:32:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:32:24,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-14 14:32:27,086 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:27,087 INFO L225 Difference]: With dead ends: 40 [2022-04-14 14:32:27,088 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 14:32:27,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:32:27,089 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:32:27,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 7 Unknown, 0 Unchecked, 14.9s Time] [2022-04-14 14:32:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 14:32:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 14:32:27,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:32:27,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:27,103 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:27,103 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:27,105 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-14 14:32:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-14 14:32:27,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:27,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:27,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-14 14:32:27,106 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-14 14:32:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:27,107 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-14 14:32:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-14 14:32:27,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:27,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:27,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:32:27,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:32:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 14:32:27,109 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-14 14:32:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:32:27,110 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 14:32:27,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 14:32:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 14:32:27,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:32:27,111 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:32:27,134 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:32:27,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:27,327 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:32:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:32:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash 810499578, now seen corresponding path program 1 times [2022-04-14 14:32:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:32:27,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131278819] [2022-04-14 14:32:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:27,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:32:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:32:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:27,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(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; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:27,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:27,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} #76#return; {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:27,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:32:27,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(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; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:27,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:27,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} #76#return; {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:27,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:27,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:27,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1227#(= main_~l~0 0)} is VALID [2022-04-14 14:32:27,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1227#(= main_~l~0 0)} is VALID [2022-04-14 14:32:27,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1227#(= main_~l~0 0)} is VALID [2022-04-14 14:32:27,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-14 14:32:27,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-14 14:32:27,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-14 14:32:27,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-14 14:32:27,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-14 14:32:27,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-14 14:32:27,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-14 14:32:27,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1221#false} is VALID [2022-04-14 14:32:27,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {1221#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1221#false} is VALID [2022-04-14 14:32:27,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {1221#false} ~cond := #in~cond; {1221#false} is VALID [2022-04-14 14:32:27,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {1221#false} assume 0 == ~cond; {1221#false} is VALID [2022-04-14 14:32:27,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-14 14:32:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:32:27,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131278819] [2022-04-14 14:32:27,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131278819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:27,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287124505] [2022-04-14 14:32:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:27,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:27,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:32:27,768 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:32:27,772 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:32:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:27,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 14:32:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:27,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:32:28,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-14 14:32:28,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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; {1220#true} is VALID [2022-04-14 14:32:28,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-14 14:32:28,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #76#return; {1220#true} is VALID [2022-04-14 14:32:28,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-14 14:32:28,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:28,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= 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:32:28,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= 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:32:28,464 INFO L272 TraceCheckUtils]: 17: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~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 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:28,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:28,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-14 14:32:28,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-14 14:32:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:28,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:32:28,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-14 14:32:28,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-14 14:32:28,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:28,866 INFO L272 TraceCheckUtils]: 17: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:28,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:28,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:30,986 WARN L290 TraceCheckUtils]: 14: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:32:30,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:30,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:30,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:30,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:30,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:33,113 WARN L290 TraceCheckUtils]: 8: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:32:33,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:33,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:33,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:33,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-14 14:32:33,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #76#return; {1220#true} is VALID [2022-04-14 14:32:33,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-14 14:32:33,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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; {1220#true} is VALID [2022-04-14 14:32:33,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-14 14:32:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 14:32:33,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287124505] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:33,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:32:33,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-14 14:32:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388848473] [2022-04-14 14:32:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:32:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 14:32:33,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:32:33,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:37,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:37,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:32:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:32:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:32:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:32:37,355 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:39,412 WARN L534 Checker$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:41,570 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:43,730 WARN L534 Checker$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:45,844 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:32:48,062 WARN L534 Checker$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:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:48,340 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-14 14:32:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:32:48,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 14:32:48,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:32:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:32:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:32:48,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-14 14:32:52,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:52,638 INFO L225 Difference]: With dead ends: 45 [2022-04-14 14:32:52,638 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 14:32:52,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:32:52,639 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-14 14:32:52,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-14 14:32:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 14:32:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-14 14:32:52,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:32:52,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:52,660 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:52,660 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:52,662 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 14:32:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-14 14:32:52,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:52,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:52,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-14 14:32:52,663 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-14 14:32:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:52,664 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 14:32:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-14 14:32:52,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:52,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:52,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:32:52,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:32:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-14 14:32:52,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-14 14:32:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:32:52,666 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-14 14:32:52,667 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-14 14:32:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 14:32:52,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:32:52,667 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:32:52,686 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:32:52,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:52,880 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:32:52,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:32:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1848843560, now seen corresponding path program 1 times [2022-04-14 14:32:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:32:52,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861595081] [2022-04-14 14:32:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:32:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:32:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:53,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {1571#(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; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:53,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:53,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1555#true} #76#return; {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:53,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1571#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:32:53,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#(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; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:53,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:53,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1555#true} #76#return; {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:53,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:53,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1561#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:53,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1561#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:53,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:53,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:53,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1566#(and (<= (+ (* (div (+ main_~k~0 main_~v2~0 4294967293) 4294967296) 4294967296) 1) main_~l~0) (<= (+ main_~l~0 1) (+ main_~k~0 main_~v2~0)) (<= (+ main_~l~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:53,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {1566#(and (<= (+ (* (div (+ main_~k~0 main_~v2~0 4294967293) 4294967296) 4294967296) 1) main_~l~0) (<= (+ main_~l~0 1) (+ main_~k~0 main_~v2~0)) (<= (+ main_~l~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0) (<= (div main_~l~0 4294967296) 0))} ~l~0 := 1 + ~l~0; {1567#(and (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 main_~v2~0)) (<= (+ main_~k~0 main_~v2~0) main_~l~0))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:53,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#(and (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 main_~v2~0)) (<= (+ main_~k~0 main_~v2~0) main_~l~0))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1568#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:53,702 INFO L272 TraceCheckUtils]: 18: Hoare triple {1568#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:32:53,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {1569#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1570#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:32:53,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {1570#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1556#false} is VALID [2022-04-14 14:32:53,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} assume !false; {1556#false} is VALID [2022-04-14 14:32:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:53,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:32:53,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861595081] [2022-04-14 14:32:53,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861595081] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:53,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110107305] [2022-04-14 14:32:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:53,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:32:53,704 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:32:53,709 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:32:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:53,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 14:32:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:53,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:32:56,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1555#true} is VALID [2022-04-14 14:32:56,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#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; {1555#true} is VALID [2022-04-14 14:32:56,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume true; {1555#true} is VALID [2022-04-14 14:32:56,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} #76#return; {1555#true} is VALID [2022-04-14 14:32:56,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} call #t~ret5 := main(); {1555#true} is VALID [2022-04-14 14:32:56,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:56,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:56,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:56,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:56,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1621#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-14 14:32:56,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} ~l~0 := 1 + ~l~0; {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:56,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:56,163 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:56,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:56,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {1636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1556#false} is VALID [2022-04-14 14:32:56,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} assume !false; {1556#false} is VALID [2022-04-14 14:32:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:56,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:32:56,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} assume !false; {1556#false} is VALID [2022-04-14 14:32:56,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {1636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1556#false} is VALID [2022-04-14 14:32:56,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:56,539 INFO L272 TraceCheckUtils]: 18: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:56,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:32:56,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:56,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:58,667 WARN L290 TraceCheckUtils]: 8: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1659#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:32:58,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:58,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:58,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:32:58,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} call #t~ret5 := main(); {1555#true} is VALID [2022-04-14 14:32:58,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} #76#return; {1555#true} is VALID [2022-04-14 14:32:58,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} assume true; {1555#true} is VALID [2022-04-14 14:32:58,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#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; {1555#true} is VALID [2022-04-14 14:32:58,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1555#true} is VALID [2022-04-14 14:32:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 14:32:58,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110107305] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:58,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:32:58,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 9] total 21 [2022-04-14 14:32:58,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845773686] [2022-04-14 14:32:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:32:58,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 14:32:58,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:32:58,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:00,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:00,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:33:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:33:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:33:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:33:00,835 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:05,026 WARN L534 Checker$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:07,197 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:33:09,375 WARN L534 Checker$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:11,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:33:13,728 WARN L534 Checker$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:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:14,068 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-14 14:33:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:33:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 14:33:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:33:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:33:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:33:14,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-14 14:33:16,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:16,282 INFO L225 Difference]: With dead ends: 53 [2022-04-14 14:33:16,282 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 14:33:16,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-14 14:33:16,283 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:33:16,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-04-14 14:33:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 14:33:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-14 14:33:16,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:33:16,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:16,301 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:16,301 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:16,303 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-14 14:33:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-14 14:33:16,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:16,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:16,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-14 14:33:16,304 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-14 14:33:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:16,306 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-14 14:33:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-14 14:33:16,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:16,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:16,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:33:16,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:33:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-14 14:33:16,308 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-14 14:33:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:33:16,308 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-14 14:33:16,308 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-14 14:33:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 14:33:16,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:33:16,309 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:33:16,337 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:33:16,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:16,510 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:33:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:33:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1315888599, now seen corresponding path program 1 times [2022-04-14 14:33:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:33:16,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012831826] [2022-04-14 14:33:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:33:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:33:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:16,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#(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; {1937#true} is VALID [2022-04-14 14:33:16,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-14 14:33:16,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-14 14:33:16,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1944#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:33:16,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#(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; {1937#true} is VALID [2022-04-14 14:33:16,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-14 14:33:16,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-14 14:33:16,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret5 := main(); {1937#true} is VALID [2022-04-14 14:33:16,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {1937#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1942#(= main_~l~0 0)} is VALID [2022-04-14 14:33:16,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1942#(= main_~l~0 0)} is VALID [2022-04-14 14:33:16,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1942#(= main_~l~0 0)} is VALID [2022-04-14 14:33:16,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1942#(= main_~l~0 0)} is VALID [2022-04-14 14:33:16,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1942#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:16,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:16,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#(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); {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:16,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#(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); {1943#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:16,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#(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; {1938#false} is VALID [2022-04-14 14:33:16,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#false} ~l~0 := 1 + ~l~0; {1938#false} is VALID [2022-04-14 14:33:16,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1938#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1938#false} is VALID [2022-04-14 14:33:16,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {1938#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); {1938#false} is VALID [2022-04-14 14:33:16,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1938#false} is VALID [2022-04-14 14:33:16,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#false} ~l~0 := 1 + ~l~0; {1938#false} is VALID [2022-04-14 14:33:16,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1938#false} is VALID [2022-04-14 14:33:16,605 INFO L272 TraceCheckUtils]: 20: Hoare triple {1938#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1938#false} is VALID [2022-04-14 14:33:16,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {1938#false} ~cond := #in~cond; {1938#false} is VALID [2022-04-14 14:33:16,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {1938#false} assume 0 == ~cond; {1938#false} is VALID [2022-04-14 14:33:16,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2022-04-14 14:33:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 14:33:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:33:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012831826] [2022-04-14 14:33:16,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012831826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265829703] [2022-04-14 14:33:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:16,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:33:16,610 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:33:16,611 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:33:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:16,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 14:33:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:16,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:33:17,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1937#true} is VALID [2022-04-14 14:33:17,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#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; {1937#true} is VALID [2022-04-14 14:33:17,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-14 14:33:17,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-14 14:33:17,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret5 := main(); {1937#true} is VALID [2022-04-14 14:33:17,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1937#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1963#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1973#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {1973#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1977#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1990#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1990#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 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); {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:17,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2004#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:33:17,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {2004#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:33:17,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-14 14:33:17,270 INFO L272 TraceCheckUtils]: 20: Hoare triple {2008#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:17,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:17,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1938#false} is VALID [2022-04-14 14:33:17,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2022-04-14 14:33:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:33:17,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:33:17,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {1938#false} assume !false; {1938#false} is VALID [2022-04-14 14:33:17,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1938#false} is VALID [2022-04-14 14:33:17,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:17,545 INFO L272 TraceCheckUtils]: 20: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:17,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:17,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,668 WARN L290 TraceCheckUtils]: 17: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:19,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:33:19,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:19,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,860 WARN L290 TraceCheckUtils]: 8: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2042#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:21,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {1937#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2035#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:21,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {1937#true} call #t~ret5 := main(); {1937#true} is VALID [2022-04-14 14:33:21,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1937#true} {1937#true} #76#return; {1937#true} is VALID [2022-04-14 14:33:21,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {1937#true} assume true; {1937#true} is VALID [2022-04-14 14:33:21,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1937#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; {1937#true} is VALID [2022-04-14 14:33:21,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {1937#true} call ULTIMATE.init(); {1937#true} is VALID [2022-04-14 14:33:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 14:33:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265829703] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:21,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:33:21,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:33:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998933516] [2022-04-14 14:33:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:33:21,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 14:33:21,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:33:21,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:26,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:26,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:33:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:33:26,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:33:26,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:33:26,171 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:28,236 WARN L534 Checker$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:30,404 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:33:32,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:34,748 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:33:36,935 WARN L534 Checker$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:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:37,143 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-04-14 14:33:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:33:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 14:33:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:33:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:33:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:33:37,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-14 14:33:41,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:41,428 INFO L225 Difference]: With dead ends: 59 [2022-04-14 14:33:41,428 INFO L226 Difference]: Without dead ends: 54 [2022-04-14 14:33:41,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:33:41,429 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-14 14:33:41,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 10.7s Time] [2022-04-14 14:33:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-14 14:33:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-14 14:33:41,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:33:41,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:41,444 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:41,444 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:41,446 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-14 14:33:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-14 14:33:41,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:41,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:41,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-14 14:33:41,447 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-14 14:33:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:41,448 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-14 14:33:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-14 14:33:41,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:41,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:41,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:33:41,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:33:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-14 14:33:41,450 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-14 14:33:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:33:41,450 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-14 14:33:41,451 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-14 14:33:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 14:33:41,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:33:41,452 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:33:41,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 14:33:41,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:41,666 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:33:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:33:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1010807906, now seen corresponding path program 1 times [2022-04-14 14:33:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:33:41,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149700913] [2022-04-14 14:33:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:33:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:33:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:42,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {2352#(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; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:42,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:42,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2341#true} #76#return; {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:42,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {2341#true} call ULTIMATE.init(); {2352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:33:42,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2352#(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; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:42,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:33:42,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2341#true} #76#return; {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:42,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:42,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2347#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:33:42,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {2347#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:42,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:42,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:33:42,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {2348#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:33:42,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:33:42,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:33:42,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:33:42,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:33:42,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:33:42,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {2349#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {2350#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0))))} is VALID [2022-04-14 14:33:42,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {2350#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:33:42,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:33:42,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#false} ~l~0 := 1 + ~l~0; {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {2342#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L272 TraceCheckUtils]: 21: Hoare triple {2342#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {2342#false} ~cond := #in~cond; {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#false} assume 0 == ~cond; {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-04-14 14:33:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:33:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:33:42,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149700913] [2022-04-14 14:33:42,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149700913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:42,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434816245] [2022-04-14 14:33:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:42,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:42,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:33:42,048 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:33:42,052 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:33:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:42,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 14:33:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:42,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:33:42,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {2341#true} call ULTIMATE.init(); {2341#true} is VALID [2022-04-14 14:33:42,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#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; {2341#true} is VALID [2022-04-14 14:33:42,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2341#true} assume true; {2341#true} is VALID [2022-04-14 14:33:42,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2341#true} {2341#true} #76#return; {2341#true} is VALID [2022-04-14 14:33:42,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {2341#true} call #t~ret5 := main(); {2341#true} is VALID [2022-04-14 14:33:42,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {2372#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2382#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:42,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {2386#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2402#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~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:33:42,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {2402#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~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; {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= 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:33:42,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= 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:33:42,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~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); {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= 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:33:42,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~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 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2416#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:33:42,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {2416#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {2420#(and (= main_~k~0 0) (= 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 1))} is VALID [2022-04-14 14:33:42,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(and (= main_~k~0 0) (= 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 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2420#(and (= main_~k~0 0) (= 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 1))} is VALID [2022-04-14 14:33:42,811 INFO L272 TraceCheckUtils]: 21: Hoare triple {2420#(and (= main_~k~0 0) (= 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 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:42,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:42,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2342#false} is VALID [2022-04-14 14:33:42,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-04-14 14:33:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:33:42,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:33:43,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#false} assume !false; {2342#false} is VALID [2022-04-14 14:33:43,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2342#false} is VALID [2022-04-14 14:33:43,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:43,218 INFO L272 TraceCheckUtils]: 21: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:43,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:43,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:45,340 WARN L290 TraceCheckUtils]: 18: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:45,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:45,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:45,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:47,467 WARN L290 TraceCheckUtils]: 14: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:47,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:47,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:47,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:47,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:47,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:49,592 WARN L290 TraceCheckUtils]: 8: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2454#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:33:49,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:49,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:49,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:33:49,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {2341#true} call #t~ret5 := main(); {2341#true} is VALID [2022-04-14 14:33:49,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2341#true} {2341#true} #76#return; {2341#true} is VALID [2022-04-14 14:33:49,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {2341#true} assume true; {2341#true} is VALID [2022-04-14 14:33:49,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#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; {2341#true} is VALID [2022-04-14 14:33:49,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {2341#true} call ULTIMATE.init(); {2341#true} is VALID [2022-04-14 14:33:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 14:33:49,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434816245] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:49,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:33:49,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-14 14:33:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271259145] [2022-04-14 14:33:49,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:33:49,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 14:33:49,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:33:49,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:55,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:55,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:33:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:33:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:33:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:33:55,989 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:33:58,081 WARN L534 Checker$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:00,253 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:02,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:02,794 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-14 14:34:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:34:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 14:34:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:34:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:34:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 14:34:02,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-14 14:34:09,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 36 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:34:09,230 INFO L225 Difference]: With dead ends: 56 [2022-04-14 14:34:09,230 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 14:34:09,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-14 14:34:09,231 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:34:09,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-14 14:34:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 14:34:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-14 14:34:09,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:34:09,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:09,245 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:09,245 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:09,248 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-14 14:34:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-14 14:34:09,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:09,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:09,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-14 14:34:09,249 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-14 14:34:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:09,250 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-14 14:34:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-14 14:34:09,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:09,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:09,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:34:09,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:34:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-14 14:34:09,251 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-14 14:34:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:34:09,252 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-14 14:34:09,252 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-14 14:34:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 14:34:09,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:34:09,252 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:34:09,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 14:34:09,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:09,467 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:34:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:34:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash 430197904, now seen corresponding path program 1 times [2022-04-14 14:34:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:34:09,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889802494] [2022-04-14 14:34:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:34:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:34:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:09,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2748#(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; {2740#true} is VALID [2022-04-14 14:34:09,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-14 14:34:09,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-14 14:34:09,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2748#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:34:09,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2748#(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; {2740#true} is VALID [2022-04-14 14:34:09,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-14 14:34:09,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-14 14:34:09,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret5 := main(); {2740#true} is VALID [2022-04-14 14:34:09,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2745#(= main_~l~0 0)} is VALID [2022-04-14 14:34:09,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2745#(= main_~l~0 0)} is VALID [2022-04-14 14:34:09,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {2745#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2745#(= main_~l~0 0)} is VALID [2022-04-14 14:34:09,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2745#(= main_~l~0 0)} is VALID [2022-04-14 14:34:09,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {2745#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {2746#(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); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {2746#(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); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {2746#(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); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {2746#(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); {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:09,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {2746#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:34:09,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:34:09,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:34:09,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {2747#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {2741#false} ~l~0 := 1 + ~l~0; {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {2741#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L272 TraceCheckUtils]: 22: Hoare triple {2741#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {2741#false} assume 0 == ~cond; {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-14 14:34:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:34:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:34:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889802494] [2022-04-14 14:34:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889802494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138960845] [2022-04-14 14:34:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:34:09,636 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:34:09,640 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:34:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:09,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 14:34:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:09,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:34:10,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-14 14:34:10,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#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; {2740#true} is VALID [2022-04-14 14:34:10,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-14 14:34:10,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-14 14:34:10,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret5 := main(); {2740#true} is VALID [2022-04-14 14:34:10,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {2800#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~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); {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:10,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~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; {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:34:10,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:34:10,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-14 14:34:10,367 INFO L272 TraceCheckUtils]: 22: Hoare triple {2818#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:10,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2829#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:10,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {2829#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2741#false} is VALID [2022-04-14 14:34:10,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-14 14:34:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:34:10,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:34:10,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2022-04-14 14:34:10,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {2829#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2741#false} is VALID [2022-04-14 14:34:10,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2829#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:10,669 INFO L272 TraceCheckUtils]: 22: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2825#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:10,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:10,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,789 WARN L290 TraceCheckUtils]: 19: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:12,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:34:12,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:12,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:14,921 WARN L290 TraceCheckUtils]: 8: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2852#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:14,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:14,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:14,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {2740#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:14,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret5 := main(); {2740#true} is VALID [2022-04-14 14:34:14,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #76#return; {2740#true} is VALID [2022-04-14 14:34:14,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2022-04-14 14:34:14,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#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; {2740#true} is VALID [2022-04-14 14:34:14,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2022-04-14 14:34:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 14:34:14,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138960845] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:14,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:34:14,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-14 14:34:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945656071] [2022-04-14 14:34:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:34:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-14 14:34:14,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:34:14,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:19,208 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:34:19,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:34:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:34:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:34:19,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:34:19,209 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:21,278 WARN L534 Checker$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:23,448 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:25,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:27,807 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:34:30,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:30,236 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2022-04-14 14:34:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:34:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-14 14:34:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:34:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:34:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:34:30,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-14 14:34:34,552 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:34:34,553 INFO L225 Difference]: With dead ends: 58 [2022-04-14 14:34:34,553 INFO L226 Difference]: Without dead ends: 53 [2022-04-14 14:34:34,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:34:34,554 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:34:34,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-04-14 14:34:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-14 14:34:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-14 14:34:34,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:34:34,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:34,573 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:34,573 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:34,574 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-14 14:34:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-14 14:34:34,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:34,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:34,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-14 14:34:34,574 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-14 14:34:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:34,575 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-14 14:34:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-14 14:34:34,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:34,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:34,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:34:34,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:34:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-14 14:34:34,577 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-14 14:34:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:34:34,577 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-14 14:34:34,577 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-14 14:34:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 14:34:34,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:34:34,578 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:34:34,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-14 14:34:34,795 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,SelfDestructingSolverStorable10 [2022-04-14 14:34:34,796 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:34:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:34:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -625372709, now seen corresponding path program 1 times [2022-04-14 14:34:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:34:34,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163451631] [2022-04-14 14:34:34,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:34:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:34:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:34,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {3155#(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; {3147#true} is VALID [2022-04-14 14:34:34,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3147#true} assume true; {3147#true} is VALID [2022-04-14 14:34:34,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3147#true} {3147#true} #76#return; {3147#true} is VALID [2022-04-14 14:34:34,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {3147#true} call ULTIMATE.init(); {3155#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:34:34,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {3155#(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; {3147#true} is VALID [2022-04-14 14:34:34,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {3147#true} assume true; {3147#true} is VALID [2022-04-14 14:34:34,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3147#true} {3147#true} #76#return; {3147#true} is VALID [2022-04-14 14:34:34,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {3147#true} call #t~ret5 := main(); {3147#true} is VALID [2022-04-14 14:34:34,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {3147#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3152#(= main_~l~0 0)} is VALID [2022-04-14 14:34:34,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {3152#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3152#(= main_~l~0 0)} is VALID [2022-04-14 14:34:34,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {3152#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3152#(= main_~l~0 0)} is VALID [2022-04-14 14:34:34,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {3152#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3152#(= main_~l~0 0)} is VALID [2022-04-14 14:34:34,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {3152#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:34,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:34,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {3153#(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); {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:34,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {3153#(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); {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:34,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {3153#(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); {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:34,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:34:34,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {3153#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:34:34,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:34:34,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:34:34,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:34:34,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:34:34,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:34:34,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3148#false} is VALID [2022-04-14 14:34:34,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {3148#false} ~l~0 := 1 + ~l~0; {3148#false} is VALID [2022-04-14 14:34:34,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {3148#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3148#false} is VALID [2022-04-14 14:34:34,922 INFO L272 TraceCheckUtils]: 24: Hoare triple {3148#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3148#false} is VALID [2022-04-14 14:34:34,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {3148#false} ~cond := #in~cond; {3148#false} is VALID [2022-04-14 14:34:34,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {3148#false} assume 0 == ~cond; {3148#false} is VALID [2022-04-14 14:34:34,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {3148#false} assume !false; {3148#false} is VALID [2022-04-14 14:34:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:34:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:34:34,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163451631] [2022-04-14 14:34:34,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163451631] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:34,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332036470] [2022-04-14 14:34:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:34,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:34:34,923 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:34:34,924 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:34:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:34,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 14:34:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:34:35,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {3147#true} call ULTIMATE.init(); {3147#true} is VALID [2022-04-14 14:34:35,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {3147#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; {3147#true} is VALID [2022-04-14 14:34:35,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {3147#true} assume true; {3147#true} is VALID [2022-04-14 14:34:35,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3147#true} {3147#true} #76#return; {3147#true} is VALID [2022-04-14 14:34:35,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {3147#true} call #t~ret5 := main(); {3147#true} is VALID [2022-04-14 14:34:35,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {3147#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3174#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {3174#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3174#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {3174#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3174#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {3174#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3184#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {3188#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3204#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {3204#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {3208#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3227#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {3227#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3231#(and (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {3231#(and (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3231#(and (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:35,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {3231#(and (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:35,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:35,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {3242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3148#false} is VALID [2022-04-14 14:34:35,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {3148#false} assume !false; {3148#false} is VALID [2022-04-14 14:34:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:34:35,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:34:35,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {3148#false} assume !false; {3148#false} is VALID [2022-04-14 14:34:35,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {3242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3148#false} is VALID [2022-04-14 14:34:35,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:35,958 INFO L272 TraceCheckUtils]: 24: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:35,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {3265#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3265#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:34:35,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:35,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {3265#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:38,088 WARN L290 TraceCheckUtils]: 14: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3265#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:38,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:38,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:38,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:38,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:38,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3265#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:40,218 WARN L290 TraceCheckUtils]: 8: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3265#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:34:40,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:40,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:40,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {3147#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3258#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:34:40,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {3147#true} call #t~ret5 := main(); {3147#true} is VALID [2022-04-14 14:34:40,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3147#true} {3147#true} #76#return; {3147#true} is VALID [2022-04-14 14:34:40,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {3147#true} assume true; {3147#true} is VALID [2022-04-14 14:34:40,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {3147#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; {3147#true} is VALID [2022-04-14 14:34:40,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {3147#true} call ULTIMATE.init(); {3147#true} is VALID [2022-04-14 14:34:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 14:34:40,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332036470] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:40,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:34:40,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-14 14:34:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963927201] [2022-04-14 14:34:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:34:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-14 14:34:40,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:34:40,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:44,501 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:34:44,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:34:44,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:34:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:34:44,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:34:44,502 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:46,551 WARN L534 Checker$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:48,693 WARN L534 Checker$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:50,862 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:53,035 WARN L534 Checker$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:57,354 WARN L534 Checker$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:59,471 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:34:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:59,789 INFO L93 Difference]: Finished difference Result 71 states and 107 transitions. [2022-04-14 14:34:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:34:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-14 14:34:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:34:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:34:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:34:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-14 14:34:59,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-14 14:35:04,168 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:35:04,169 INFO L225 Difference]: With dead ends: 71 [2022-04-14 14:35:04,169 INFO L226 Difference]: Without dead ends: 66 [2022-04-14 14:35:04,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:35:04,170 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:35:04,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 6 Unknown, 0 Unchecked, 13.0s Time] [2022-04-14 14:35:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-14 14:35:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-14 14:35:04,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:35:04,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:04,190 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:04,190 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:04,191 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-14 14:35:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-14 14:35:04,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:04,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:04,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-14 14:35:04,192 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-14 14:35:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:04,193 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-14 14:35:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-14 14:35:04,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:04,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:04,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:35:04,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:35:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-14 14:35:04,195 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-14 14:35:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:35:04,195 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-14 14:35:04,195 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-14 14:35:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 14:35:04,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:35:04,196 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:35:04,219 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:35:04,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:04,411 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:35:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:35:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1068183491, now seen corresponding path program 1 times [2022-04-14 14:35:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:35:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624799150] [2022-04-14 14:35:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:35:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:35:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:04,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {3645#(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; {3637#true} is VALID [2022-04-14 14:35:04,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {3637#true} assume true; {3637#true} is VALID [2022-04-14 14:35:04,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3637#true} {3637#true} #76#return; {3637#true} is VALID [2022-04-14 14:35:04,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {3637#true} call ULTIMATE.init(); {3645#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:35:04,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {3645#(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; {3637#true} is VALID [2022-04-14 14:35:04,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {3637#true} assume true; {3637#true} is VALID [2022-04-14 14:35:04,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3637#true} {3637#true} #76#return; {3637#true} is VALID [2022-04-14 14:35:04,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {3637#true} call #t~ret5 := main(); {3637#true} is VALID [2022-04-14 14:35:04,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {3637#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3642#(= main_~l~0 0)} is VALID [2022-04-14 14:35:04,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {3642#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3642#(= main_~l~0 0)} is VALID [2022-04-14 14:35:04,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {3642#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3642#(= main_~l~0 0)} is VALID [2022-04-14 14:35:04,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {3642#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3642#(= main_~l~0 0)} is VALID [2022-04-14 14:35:04,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {3642#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:04,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:04,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {3643#(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); {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:04,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {3643#(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); {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:04,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {3643#(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); {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:04,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:35:04,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {3643#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:35:04,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:35:04,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:35:04,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:35:04,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:35:04,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {3638#false} ~l~0 := 1 + ~l~0; {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {3638#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {3638#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); {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {3638#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {3638#false} ~l~0 := 1 + ~l~0; {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {3638#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3638#false} is VALID [2022-04-14 14:35:04,525 INFO L272 TraceCheckUtils]: 28: Hoare triple {3638#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3638#false} is VALID [2022-04-14 14:35:04,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {3638#false} ~cond := #in~cond; {3638#false} is VALID [2022-04-14 14:35:04,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {3638#false} assume 0 == ~cond; {3638#false} is VALID [2022-04-14 14:35:04,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {3638#false} assume !false; {3638#false} is VALID [2022-04-14 14:35:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 14:35:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:35:04,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624799150] [2022-04-14 14:35:04,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624799150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:04,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773527343] [2022-04-14 14:35:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:04,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:04,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:35:04,536 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:35:04,537 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:35:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:04,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-14 14:35:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:04,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:35:05,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {3637#true} call ULTIMATE.init(); {3637#true} is VALID [2022-04-14 14:35:05,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {3637#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; {3637#true} is VALID [2022-04-14 14:35:05,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {3637#true} assume true; {3637#true} is VALID [2022-04-14 14:35:05,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3637#true} {3637#true} #76#return; {3637#true} is VALID [2022-04-14 14:35:05,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {3637#true} call #t~ret5 := main(); {3637#true} is VALID [2022-04-14 14:35:05,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {3637#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3664#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {3664#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3664#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {3664#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3664#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {3664#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {3674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {3678#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3694#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {3694#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= 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); {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~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); {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {3698#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3717#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:05,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {3717#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3721#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~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:35:05,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {3721#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3721#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~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:35:05,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {3721#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~l~0 3) (= 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); {3721#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~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:35:05,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {3721#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~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; {3731#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:05,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {3731#(and (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {3735#(and (= 3 (+ (- 1) main_~l~0)) (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:05,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {3735#(and (= 3 (+ (- 1) main_~l~0)) (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3735#(and (= 3 (+ (- 1) main_~l~0)) (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:35:05,358 INFO L272 TraceCheckUtils]: 28: Hoare triple {3735#(and (= 3 (+ (- 1) main_~l~0)) (= main_~j~0 0) (= main_~v2~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:05,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:05,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {3746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3638#false} is VALID [2022-04-14 14:35:05,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {3638#false} assume !false; {3638#false} is VALID [2022-04-14 14:35:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:35:05,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:35:05,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {3638#false} assume !false; {3638#false} is VALID [2022-04-14 14:35:05,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {3746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3638#false} is VALID [2022-04-14 14:35:05,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:05,724 INFO L272 TraceCheckUtils]: 28: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:05,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:05,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,854 WARN L290 TraceCheckUtils]: 25: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:35:07,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 14:35:07,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:07,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:10,062 WARN L290 TraceCheckUtils]: 14: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:35:10,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:10,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:10,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:10,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:10,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:12,194 WARN L290 TraceCheckUtils]: 8: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3769#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 14:35:12,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:12,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:12,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {3637#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3762#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 14:35:12,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {3637#true} call #t~ret5 := main(); {3637#true} is VALID [2022-04-14 14:35:12,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3637#true} {3637#true} #76#return; {3637#true} is VALID [2022-04-14 14:35:12,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {3637#true} assume true; {3637#true} is VALID [2022-04-14 14:35:12,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {3637#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; {3637#true} is VALID [2022-04-14 14:35:12,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {3637#true} call ULTIMATE.init(); {3637#true} is VALID [2022-04-14 14:35:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-14 14:35:12,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773527343] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:12,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:35:12,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 13] total 19 [2022-04-14 14:35:12,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226144065] [2022-04-14 14:35:12,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:35:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-14 14:35:12,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:35:12,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:18,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:35:18,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:35:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:35:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:35:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:35:18,592 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:20,640 WARN L534 Checker$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:22,781 WARN L534 Checker$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:24,950 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:27,196 WARN L534 Checker$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,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:27,485 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-14 14:35:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:35:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-14 14:35:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:35:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-14 14:35:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-14 14:35:27,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-14 14:35:33,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 21 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:35:33,956 INFO L225 Difference]: With dead ends: 66 [2022-04-14 14:35:33,956 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 14:35:33,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:35:33,957 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:35:33,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2022-04-14 14:35:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 14:35:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 14:35:33,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:35:33,958 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:35:33,958 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:35:33,959 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:35:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:33,959 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:35:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:35:33,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:33,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:33,959 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:35:33,959 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:35:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:33,959 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:35:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:35:33,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:33,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:33,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:35:33,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:35:33,960 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:35:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 14:35:33,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-14 14:35:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:35:33,960 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 14:35:33,960 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:35:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:35:33,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:33,962 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 14:35:33,979 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:35:34,171 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,SelfDestructingSolverStorable12 [2022-04-14 14:35:34,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 14:35:34,292 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-14 14:35:34,292 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-14 14:35:34,292 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-14 14:35:34,292 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 34) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L31-2(lines 23 34) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 34) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 39) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 34) no Hoare annotation was computed. [2022-04-14 14:35:34,293 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-14 14:35:34,293 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-14 14:35:34,294 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 39) no Hoare annotation was computed. [2022-04-14 14:35:34,294 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 39) the Hoare annotation is: true [2022-04-14 14:35:34,294 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-14 14:35:34,294 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-14 14:35:34,294 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:35:34,294 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:35:34,294 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:35:34,294 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:35:34,294 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:35:34,294 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 14:35:34,294 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:35:34,294 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-14 14:35:34,295 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-14 14:35:34,295 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-14 14:35:34,295 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-14 14:35:34,295 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-14 14:35:34,295 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-14 14:35:34,298 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:35:34,299 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 14:35:34,302 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 14:35:34,302 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:35:34,312 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-14 14:35:34,313 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 14:35:34,314 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-14 14:35:34,314 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 14:35:34,314 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 14:35:34,314 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-14 14:35:34,314 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-14 14:35:34,315 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-14 14:35:34,316 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-14 14:35:34,317 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-14 14:35:34,317 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-14 14:35:34,317 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-14 14:35:34,317 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 14:35:34,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:35:34 BoogieIcfgContainer [2022-04-14 14:35:34,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 14:35:34,329 INFO L158 Benchmark]: Toolchain (without parser) took 326808.94ms. Allocated memory was 174.1MB in the beginning and 235.9MB in the end (delta: 61.9MB). Free memory was 115.4MB in the beginning and 138.9MB in the end (delta: -23.5MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2022-04-14 14:35:34,329 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 14:35:34,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.56ms. Allocated memory was 174.1MB in the beginning and 235.9MB in the end (delta: 61.9MB). Free memory was 115.1MB in the beginning and 206.7MB in the end (delta: -91.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-14 14:35:34,330 INFO L158 Benchmark]: Boogie Preprocessor took 37.65ms. Allocated memory is still 235.9MB. Free memory was 206.7MB in the beginning and 205.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 14:35:34,330 INFO L158 Benchmark]: RCFGBuilder took 6867.50ms. Allocated memory is still 235.9MB. Free memory was 205.2MB in the beginning and 192.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 14:35:34,330 INFO L158 Benchmark]: TraceAbstraction took 319651.30ms. Allocated memory is still 235.9MB. Free memory was 192.1MB in the beginning and 138.9MB in the end (delta: 53.2MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2022-04-14 14:35:34,331 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.17ms. Allocated memory is still 174.1MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.56ms. Allocated memory was 174.1MB in the beginning and 235.9MB in the end (delta: 61.9MB). Free memory was 115.1MB in the beginning and 206.7MB in the end (delta: -91.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.65ms. Allocated memory is still 235.9MB. Free memory was 206.7MB in the beginning and 205.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 6867.50ms. Allocated memory is still 235.9MB. Free memory was 205.2MB in the beginning and 192.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 319651.30ms. Allocated memory is still 235.9MB. Free memory was 192.1MB in the beginning and 138.9MB in the end (delta: 53.2MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 319.6s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 221.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 58 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 124.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 117.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 187 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 365 SyntacticMatches, 37 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 26 NumberOfFragments, 64 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 660 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 53.9s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 8631 SizeOfPredicates, 10 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 152/307 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: ((i + k + j + v3 + v2 + v4) % 4294967296 == l % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2022-04-14 14:35:34,353 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...