/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/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:29:01,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:29:01,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:29:01,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:29:01,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:29:01,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:29:01,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:29:01,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:29:01,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:29:01,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:29:01,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:29:01,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:29:01,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:29:01,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:29:01,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:29:01,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:29:01,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:29:01,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:29:01,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:29:01,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:29:01,679 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:29:01,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:29:01,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:29:01,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:29:01,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:29:01,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:29:01,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:29:01,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:29:01,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:29:01,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:29:01,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:29:01,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:29:01,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:29:01,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:29:01,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:29:01,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:29:01,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:29:01,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:29:01,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:29:01,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:29:01,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:29:01,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:29:01,699 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-27 11:29:01,722 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:29:01,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:29:01,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:29:01,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:29:01,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:29:01,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:29:01,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:29:01,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:29:01,723 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:29:01,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:29:01,724 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:29:01,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:29:01,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:29:01,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:29:01,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:29:01,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:29:01,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:29:01,725 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:29:01,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:29:01,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:29:01,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:29:01,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:29:01,727 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:29:01,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:29:01,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:29:01,727 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-27 11:29:01,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:29:01,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:29:01,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:29:01,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:29:01,917 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:29:01,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-27 11:29:01,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89406f366/1ca908dfebc24f27b6a84ca31c5194ed/FLAG7cb332d09 [2022-04-27 11:29:02,272 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:29:02,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-27 11:29:02,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89406f366/1ca908dfebc24f27b6a84ca31c5194ed/FLAG7cb332d09 [2022-04-27 11:29:02,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89406f366/1ca908dfebc24f27b6a84ca31c5194ed [2022-04-27 11:29:02,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:29:02,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:29:02,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:29:02,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:29:02,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:29:02,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02, skipping insertion in model container [2022-04-27 11:29:02,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:29:02,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:29:02,849 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/sum_by_3.c[406,419] [2022-04-27 11:29:02,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:29:02,877 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:29:02,887 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/sum_by_3.c[406,419] [2022-04-27 11:29:02,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:29:02,912 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:29:02,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02 WrapperNode [2022-04-27 11:29:02,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:29:02,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:29:02,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:29:02,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:29:02,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:29:02,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:29:02,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:29:02,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:29:02,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (1/1) ... [2022-04-27 11:29:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:29:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:29:02,963 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-27 11:29:02,979 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-27 11:29:02,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:29:02,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:29:02,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:29:02,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:29:02,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:29:02,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:29:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:29:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:29:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:29:03,042 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:29:03,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:29:03,204 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:29:03,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:29:03,209 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 11:29:03,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:29:03 BoogieIcfgContainer [2022-04-27 11:29:03,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:29:03,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:29:03,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:29:03,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:29:03,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:29:02" (1/3) ... [2022-04-27 11:29:03,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e792fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:29:03, skipping insertion in model container [2022-04-27 11:29:03,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:29:02" (2/3) ... [2022-04-27 11:29:03,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e792fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:29:03, skipping insertion in model container [2022-04-27 11:29:03,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:29:03" (3/3) ... [2022-04-27 11:29:03,227 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-04-27 11:29:03,236 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:29:03,236 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:29:03,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:29:03,294 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@582af37a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@304461be [2022-04-27 11:29:03,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:29:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-27 11:29:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:29:03,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:03,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:03,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:03,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-04-27 11:29:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:03,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234586447] [2022-04-27 11:29:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:03,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-27 11:29:03,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:29:03,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-27 11:29:03,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:03,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-27 11:29:03,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:29:03,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-27 11:29:03,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-27 11:29:03,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {27#true} is VALID [2022-04-27 11:29:03,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {27#true} is VALID [2022-04-27 11:29:03,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-27 11:29:03,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {27#true} is VALID [2022-04-27 11:29:03,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-27 11:29:03,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} ~k~0 := ~j~0; {27#true} is VALID [2022-04-27 11:29:03,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 11:29:03,498 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-27 11:29:03,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 11:29:03,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 11:29:03,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 11:29:03,499 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-27 11:29:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:03,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234586447] [2022-04-27 11:29:03,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234586447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:29:03,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:29:03,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:29:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475155788] [2022-04-27 11:29:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:29:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-27 11:29:03,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:03,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 11:29:03,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:29:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:29:03,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:29:03,551 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 11:29:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:03,616 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-27 11:29:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:29:03,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-27 11:29:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:29:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 11:29:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 11:29:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 11:29:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 11:29:03,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-27 11:29:03,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:03,708 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:29:03,708 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:29:03,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:29:03,724 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 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-27 11:29:03,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:29:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:29:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:29:03,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:29:03,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:03,744 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:03,744 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:03,746 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:29:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:29:03,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:03,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:03,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:29:03,762 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:29:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:03,764 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:29:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:29:03,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:03,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:03,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:29:03,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:29:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 11:29:03,767 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-27 11:29:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:29:03,767 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 11:29:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 11:29:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:29:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:29:03,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:03,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:03,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:29:03,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:03,769 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-04-27 11:29:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:03,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312990170] [2022-04-27 11:29:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:04,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {148#true} #75#return; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:04,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {148#true} #75#return; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:04,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:04,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:04,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:04,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:04,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 11:29:04,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 11:29:04,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:29:04,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {158#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:29:04,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {158#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {149#false} is VALID [2022-04-27 11:29:04,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-04-27 11:29:04,303 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-27 11:29:04,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312990170] [2022-04-27 11:29:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312990170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:29:04,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:29:04,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:29:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180751611] [2022-04-27 11:29:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:29:04,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:04,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:04,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:29:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:29:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:29:04,328 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:04,738 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-27 11:29:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:29:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:29:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-27 11:29:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-27 11:29:04,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-27 11:29:04,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:04,801 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:29:04,801 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 11:29:04,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:29:04,802 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:29:04,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:29:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 11:29:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-27 11:29:04,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:29:04,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:04,820 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:04,821 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:04,822 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-27 11:29:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 11:29:04,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:04,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:04,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 11:29:04,823 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 11:29:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:04,824 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-27 11:29:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 11:29:04,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:04,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:04,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:29:04,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:29:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-27 11:29:04,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-27 11:29:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:29:04,826 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-27 11:29:04,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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-27 11:29:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 11:29:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:29:04,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:04,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:04,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:29:04,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:04,828 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-04-27 11:29:04,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:04,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186518197] [2022-04-27 11:29:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:04,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:04,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {316#true} is VALID [2022-04-27 11:29:04,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-27 11:29:04,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #75#return; {316#true} is VALID [2022-04-27 11:29:04,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {323#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:04,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {316#true} is VALID [2022-04-27 11:29:04,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-27 11:29:04,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #75#return; {316#true} is VALID [2022-04-27 11:29:04,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret5 := main(); {316#true} is VALID [2022-04-27 11:29:04,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {316#true} is VALID [2022-04-27 11:29:04,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {316#true} is VALID [2022-04-27 11:29:04,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {316#true} is VALID [2022-04-27 11:29:04,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {316#true} is VALID [2022-04-27 11:29:04,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {316#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {321#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-27 11:29:04,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} ~k~0 := ~j~0; {322#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 11:29:04,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {322#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} assume !!(~k~0 % 4294967296 < ~n~0 % 4294967296);~k~0 := 1 + ~k~0; {317#false} is VALID [2022-04-27 11:29:04,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {317#false} is VALID [2022-04-27 11:29:04,916 INFO L272 TraceCheckUtils]: 13: Hoare triple {317#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {317#false} is VALID [2022-04-27 11:29:04,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-27 11:29:04,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-27 11:29:04,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-27 11:29:04,916 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-27 11:29:04,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186518197] [2022-04-27 11:29:04,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186518197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:29:04,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:29:04,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:29:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234196117] [2022-04-27 11:29:04,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:29:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 11:29:04,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:04,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:04,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:04,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:29:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:29:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:29:04,931 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:05,066 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 11:29:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:29:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 11:29:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:29:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 11:29:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 11:29:05,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 11:29:05,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:05,094 INFO L225 Difference]: With dead ends: 28 [2022-04-27 11:29:05,094 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 11:29:05,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:29:05,095 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:29:05,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:29:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 11:29:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 11:29:05,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:29:05,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,111 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,111 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:05,113 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 11:29:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:29:05,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:05,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:05,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 11:29:05,114 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 11:29:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:05,115 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 11:29:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:29:05,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:05,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:05,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:29:05,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:29:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 11:29:05,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-27 11:29:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:29:05,117 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 11:29:05,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:29:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:29:05,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:05,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:05,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:29:05,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1916237745, now seen corresponding path program 1 times [2022-04-27 11:29:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:05,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413452945] [2022-04-27 11:29:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:05,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {444#true} is VALID [2022-04-27 11:29:05,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume true; {444#true} is VALID [2022-04-27 11:29:05,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} #75#return; {444#true} is VALID [2022-04-27 11:29:05,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {444#true} call ULTIMATE.init(); {451#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:05,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {444#true} is VALID [2022-04-27 11:29:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} assume true; {444#true} is VALID [2022-04-27 11:29:05,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {444#true} {444#true} #75#return; {444#true} is VALID [2022-04-27 11:29:05,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {444#true} call #t~ret5 := main(); {444#true} is VALID [2022-04-27 11:29:05,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {444#true} is VALID [2022-04-27 11:29:05,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {449#(= main_~i~0 0)} is VALID [2022-04-27 11:29:05,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 11:29:05,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 11:29:05,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {445#false} is VALID [2022-04-27 11:29:05,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {445#false} is VALID [2022-04-27 11:29:05,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#false} ~k~0 := ~j~0; {445#false} is VALID [2022-04-27 11:29:05,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {445#false} is VALID [2022-04-27 11:29:05,194 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {445#false} is VALID [2022-04-27 11:29:05,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {445#false} ~cond := #in~cond; {445#false} is VALID [2022-04-27 11:29:05,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#false} assume 0 == ~cond; {445#false} is VALID [2022-04-27 11:29:05,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-04-27 11:29:05,195 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-27 11:29:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:05,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413452945] [2022-04-27 11:29:05,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413452945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:29:05,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:29:05,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:29:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680472006] [2022-04-27 11:29:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:29:05,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 11:29:05,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:05,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:05,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:29:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:29:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:29:05,211 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:05,317 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 11:29:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:29:05,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 11:29:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:29:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 11:29:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 11:29:05,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 11:29:05,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:05,353 INFO L225 Difference]: With dead ends: 28 [2022-04-27 11:29:05,354 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 11:29:05,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:29:05,364 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:29:05,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:29:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 11:29:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 11:29:05,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:29:05,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,382 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,382 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:05,383 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 11:29:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 11:29:05,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:05,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:05,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:29:05,383 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:29:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:05,384 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 11:29:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 11:29:05,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:05,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:05,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:29:05,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:29:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 11:29:05,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2022-04-27 11:29:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:29:05,385 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 11:29:05,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-27 11:29:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 11:29:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:29:05,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:05,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:05,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:29:05,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 1 times [2022-04-27 11:29:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:05,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136659042] [2022-04-27 11:29:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:06,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {565#true} #75#return; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {577#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:06,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {565#true} #75#return; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:06,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {571#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 11:29:06,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:06,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:06,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:06,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:06,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:06,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 11:29:06,039 INFO L272 TraceCheckUtils]: 13: Hoare triple {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:29:06,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {576#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:29:06,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {576#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {566#false} is VALID [2022-04-27 11:29:06,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-27 11:29:06,040 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-27 11:29:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:06,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136659042] [2022-04-27 11:29:06,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136659042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:29:06,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657606876] [2022-04-27 11:29:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:06,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:29:06,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:29:06,042 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-27 11:29:06,047 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-27 11:29:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:06,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:29:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:06,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:29:07,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-27 11:29:07,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:07,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:07,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {565#true} #75#return; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:07,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:07,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 11:29:07,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {599#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-27 11:29:07,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {603#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:29:07,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {607#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1))} is VALID [2022-04-27 11:29:07,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 11:29:07,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 11:29:07,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} ~k~0 := ~j~0; {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 11:29:07,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 11:29:07,152 INFO L272 TraceCheckUtils]: 13: Hoare triple {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:29:07,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:29:07,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-27 11:29:07,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-27 11:29:07,153 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-27 11:29:07,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:29:13,623 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~i~0 4294967296))) (let ((.cse1 (<= (mod (div (mod (+ (* .cse2 2) c_main_~i~0) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296))) (.cse0 (<= .cse2 2147483647))) (and (or (not .cse0) .cse1) (or .cse1 .cse0)))) is different from true [2022-04-27 11:29:38,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-27 11:29:38,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-27 11:29:38,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:29:38,125 INFO L272 TraceCheckUtils]: 13: Hoare triple {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:29:38,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 11:29:38,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} ~k~0 := ~j~0; {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 11:29:38,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 11:29:40,261 WARN L290 TraceCheckUtils]: 9: Hoare triple {659#(and (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (<= (mod main_~i~0 4294967296) 2147483647)) (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (<= (mod main_~i~0 4294967296) 2147483647))))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is UNKNOWN [2022-04-27 11:29:40,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#(or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {659#(and (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (<= (mod main_~i~0 4294967296) 2147483647)) (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (<= (mod main_~i~0 4294967296) 2147483647))))} is VALID [2022-04-27 11:29:42,384 WARN L290 TraceCheckUtils]: 7: Hoare triple {667#(or (<= (mod (div (mod (+ (* 2 (mod (+ main_~i~0 1) 4294967296)) main_~i~0 1) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {663#(or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is UNKNOWN [2022-04-27 11:29:42,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {565#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {667#(or (<= (mod (div (mod (+ (* 2 (mod (+ main_~i~0 1) 4294967296)) main_~i~0 1) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-27 11:29:42,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {565#true} is VALID [2022-04-27 11:29:42,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret5 := main(); {565#true} is VALID [2022-04-27 11:29:42,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #75#return; {565#true} is VALID [2022-04-27 11:29:42,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-27 11:29:42,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {565#true} is VALID [2022-04-27 11:29:42,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-27 11:29:42,386 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-27 11:29:42,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657606876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:29:42,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:29:42,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-04-27 11:29:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712904545] [2022-04-27 11:29:42,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:29:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:29:42,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:42,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:29:48,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:48,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:29:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:29:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=337, Unknown=5, NotChecked=38, Total=462 [2022-04-27 11:29:48,829 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:29:53,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:02,649 WARN L232 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:30:04,910 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~SIZE~0 4294967296)) (.cse6 (mod c_main_~i~0 4294967296)) (.cse2 (mod c_main_~n~0 4294967296))) (let ((.cse0 (< .cse6 .cse2)) (.cse4 (<= (mod (div (mod (+ (* .cse6 2) c_main_~i~0) 4294967296) 3) 4294967296) .cse3)) (.cse5 (<= .cse6 2147483647))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ c_main_~i~0 1) 4294967296))) (or (not .cse0) (< .cse1 .cse2) (<= (mod (div (mod (+ c_main_~i~0 (* .cse1 2) 1) 4294967296) 3) 4294967296) .cse3))) (<= c_~SIZE~0 20000001) (or .cse4 .cse0) (or (not .cse5) .cse4) (<= 20000001 c_~SIZE~0) (or .cse4 .cse5) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)))) is different from false [2022-04-27 11:30:15,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:24,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:35,082 WARN L232 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:30:37,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:43,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:45,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:49,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:52,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:30:54,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-27 11:30:58,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:31:00,623 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-27 11:31:03,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:31:05,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:31:10,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:31:12,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:31:14,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:31:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:31:14,831 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-27 11:31:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 11:31:14,832 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:31:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:31:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:31:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2022-04-27 11:31:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:31:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2022-04-27 11:31:14,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 60 transitions. [2022-04-27 11:31:23,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 56 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:31:23,796 INFO L225 Difference]: With dead ends: 53 [2022-04-27 11:31:23,796 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:31:23,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=8, NotChecked=142, Total=1482 [2022-04-27 11:31:23,797 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 105 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 35 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 34.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:31:23,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 37 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 184 Invalid, 16 Unknown, 26 Unchecked, 34.4s Time] [2022-04-27 11:31:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:31:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2022-04-27 11:31:23,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:31:23,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:31:23,828 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:31:23,829 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:31:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:31:23,830 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-27 11:31:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-27 11:31:23,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:31:23,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:31:23,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-27 11:31:23,830 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-27 11:31:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:31:23,831 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-27 11:31:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-27 11:31:23,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:31:23,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:31:23,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:31:23,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:31:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:31:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 11:31:23,833 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2022-04-27 11:31:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:31:23,833 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 11:31:23,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:31:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 11:31:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:31:23,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:31:23,833 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:31:23,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:31:24,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:31:24,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:31:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:31:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1604375314, now seen corresponding path program 1 times [2022-04-27 11:31:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:31:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687143263] [2022-04-27 11:31:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:31:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:31:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:31:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:31:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:31:24,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {937#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {928#true} is VALID [2022-04-27 11:31:24,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#true} assume true; {928#true} is VALID [2022-04-27 11:31:24,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {928#true} {928#true} #75#return; {928#true} is VALID [2022-04-27 11:31:24,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {937#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:31:24,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {937#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {928#true} is VALID [2022-04-27 11:31:24,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {928#true} assume true; {928#true} is VALID [2022-04-27 11:31:24,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {928#true} {928#true} #75#return; {928#true} is VALID [2022-04-27 11:31:24,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {928#true} call #t~ret5 := main(); {928#true} is VALID [2022-04-27 11:31:24,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {928#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {928#true} is VALID [2022-04-27 11:31:24,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {928#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {933#(= main_~i~0 0)} is VALID [2022-04-27 11:31:24,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {933#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {934#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:31:24,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {934#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {935#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= main_~i~0 1) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:31:24,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= main_~i~0 1) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {936#(and (<= (+ (div main_~i~0 4294967296) (div main_~j~0 4294967296)) 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:31:24,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {936#(and (<= (+ (div main_~i~0 4294967296) (div main_~j~0 4294967296)) 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#false} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#false} ~k~0 := ~j~0; {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {929#false} is VALID [2022-04-27 11:31:24,228 INFO L272 TraceCheckUtils]: 15: Hoare triple {929#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {929#false} ~cond := #in~cond; {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {929#false} assume 0 == ~cond; {929#false} is VALID [2022-04-27 11:31:24,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#false} assume !false; {929#false} is VALID [2022-04-27 11:31:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:31:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:31:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687143263] [2022-04-27 11:31:24,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687143263] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:31:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222545442] [2022-04-27 11:31:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:31:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:31:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:31:24,231 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-27 11:31:24,232 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-27 11:31:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:31:24,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:31:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:31:24,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:31:27,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {928#true} is VALID [2022-04-27 11:31:27,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {928#true} is VALID [2022-04-27 11:31:27,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {928#true} assume true; {928#true} is VALID [2022-04-27 11:31:27,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {928#true} {928#true} #75#return; {928#true} is VALID [2022-04-27 11:31:27,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {928#true} call #t~ret5 := main(); {928#true} is VALID [2022-04-27 11:31:27,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {928#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {928#true} is VALID [2022-04-27 11:31:27,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {928#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {959#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-27 11:31:27,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {963#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:31:27,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {963#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {967#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:31:27,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {967#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {971#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (mod main_~i~0 4294967296) main_~j~0) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:31:27,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (mod main_~i~0 4294967296) main_~j~0) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {975#(and (= main_~j~0 (+ (mod main_~i~0 4294967296) 1)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {975#(and (= main_~j~0 (+ (mod main_~i~0 4294967296) 1)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {929#false} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {929#false} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#false} ~k~0 := ~j~0; {929#false} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {929#false} is VALID [2022-04-27 11:31:27,648 INFO L272 TraceCheckUtils]: 15: Hoare triple {929#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {929#false} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {929#false} ~cond := #in~cond; {929#false} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {929#false} assume 0 == ~cond; {929#false} is VALID [2022-04-27 11:31:27,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#false} assume !false; {929#false} is VALID [2022-04-27 11:31:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:31:27,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:32:24,678 WARN L232 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:32:24,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#false} assume !false; {929#false} is VALID [2022-04-27 11:32:24,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {1003#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {929#false} is VALID [2022-04-27 11:32:24,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {1007#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1003#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:32:24,709 INFO L272 TraceCheckUtils]: 15: Hoare triple {1011#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {1007#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:32:24,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {1011#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {1011#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 11:32:24,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {1018#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} ~k~0 := ~j~0; {1011#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 11:32:24,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {1018#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {1018#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 11:32:26,846 WARN L290 TraceCheckUtils]: 11: Hoare triple {1025#(or (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 2) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {1018#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is UNKNOWN [2022-04-27 11:32:26,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {1029#(or (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {1025#(or (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 2) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 11:32:29,070 WARN L290 TraceCheckUtils]: 9: Hoare triple {1033#(or (<= (div (+ (* (- 1) (mod main_~i~0 4294967296)) 4294967294) (- 4294967296)) (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod main_~n~0 4294967296)) (- 4294967295)) 4294967296) 1)) (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2) 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {1029#(or (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~n~0 4294967296))))} is UNKNOWN [2022-04-27 11:32:29,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {928#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1033#(or (<= (div (+ (* (- 1) (mod main_~i~0 4294967296)) 4294967294) (- 4294967296)) (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod main_~n~0 4294967296)) (- 4294967295)) 4294967296) 1)) (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2) 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 11:32:29,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#true} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {928#true} is VALID [2022-04-27 11:32:29,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {928#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {928#true} is VALID [2022-04-27 11:32:29,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {928#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {928#true} is VALID [2022-04-27 11:32:29,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {928#true} call #t~ret5 := main(); {928#true} is VALID [2022-04-27 11:32:29,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {928#true} {928#true} #75#return; {928#true} is VALID [2022-04-27 11:32:29,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {928#true} assume true; {928#true} is VALID [2022-04-27 11:32:29,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {928#true} is VALID [2022-04-27 11:32:29,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {928#true} is VALID [2022-04-27 11:32:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:32:29,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222545442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:32:29,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:32:29,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2022-04-27 11:32:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919970148] [2022-04-27 11:32:29,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:32:29,075 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 11:32:29,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:32:29,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:37,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 35 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:32:37,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:32:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:32:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:32:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=263, Unknown=10, NotChecked=0, Total=342 [2022-04-27 11:32:37,831 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:32:42,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:32:44,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:32:46,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:32:50,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:32:59,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:01,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:03,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:06,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:14,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:32,469 WARN L232 SmtUtils]: Spent 12.97s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:33:36,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:38,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:41,083 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-27 11:33:47,847 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-27 11:33:50,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:54,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:56,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:33:58,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:34:07,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:34:44,838 WARN L232 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:34:46,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:34:53,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:34:55,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:34:58,028 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~n~0 4294967296)) (.cse0 (* 2 c_main_~j~0)) (.cse1 (mod c_~SIZE~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (<= (mod (div (mod (+ c_main_~i~0 .cse0 4) 4294967296) 3) 4294967296) .cse1) (not (< (mod (+ c_main_~j~0 1) 4294967296) .cse2))) (let ((.cse3 (mod c_main_~i~0 4294967296))) (or (<= (mod (div (mod (+ (* .cse3 2) c_main_~i~0 4) 4294967296) 3) 4294967296) .cse1) (<= (div (+ 4294967294 (* (- 1) .cse3)) (- 4294967296)) (+ (div (+ .cse3 (* (- 1) .cse2) (- 4294967295)) 4294967296) 1)))) (or (not (< (mod c_main_~j~0 4294967296) .cse2)) (<= (mod (div (mod (+ c_main_~i~0 2 .cse0) 4294967296) 3) 4294967296) .cse1)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from true [2022-04-27 11:35:00,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:35:06,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:35:08,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:35:24,647 WARN L232 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:35:33,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:35:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:35:44,775 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-27 11:35:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:35:44,776 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 11:35:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:35:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-27 11:35:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2022-04-27 11:35:44,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2022-04-27 11:35:55,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 43 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-27 11:35:55,780 INFO L225 Difference]: With dead ends: 46 [2022-04-27 11:35:55,780 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 11:35:55,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 118.6s TimeCoverageRelationStatistics Valid=178, Invalid=787, Unknown=31, NotChecked=60, Total=1056 [2022-04-27 11:35:55,781 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 21 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 53.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:35:55,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 57 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 217 Invalid, 24 Unknown, 1 Unchecked, 53.9s Time] [2022-04-27 11:35:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 11:35:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-04-27 11:35:55,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:35:55,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:55,828 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:55,828 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:35:55,829 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 11:35:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 11:35:55,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:35:55,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:35:55,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 11:35:55,830 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 11:35:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:35:55,831 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 11:35:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 11:35:55,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:35:55,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:35:55,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:35:55,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:35:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 11:35:55,832 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2022-04-27 11:35:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:35:55,832 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 11:35:55,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:35:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 11:35:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:35:55,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:35:55,833 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:35:55,850 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-27 11:35:56,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 11:35:56,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:35:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:35:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1723225391, now seen corresponding path program 2 times [2022-04-27 11:35:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:35:56,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906643234] [2022-04-27 11:35:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:35:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:35:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:35:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:35:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:35:56,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1268#true} is VALID [2022-04-27 11:35:56,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#true} assume true; {1268#true} is VALID [2022-04-27 11:35:56,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1268#true} {1268#true} #75#return; {1268#true} is VALID [2022-04-27 11:35:56,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1278#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:35:56,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#(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(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1268#true} is VALID [2022-04-27 11:35:56,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#true} assume true; {1268#true} is VALID [2022-04-27 11:35:56,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#true} {1268#true} #75#return; {1268#true} is VALID [2022-04-27 11:35:56,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#true} call #t~ret5 := main(); {1268#true} is VALID [2022-04-27 11:35:56,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1268#true} is VALID [2022-04-27 11:35:56,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {1268#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {1273#(= main_~i~0 0)} is VALID [2022-04-27 11:35:56,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {1273#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {1274#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 11:35:56,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {1274#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {1275#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-27 11:35:56,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {1275#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1276#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 2))} is VALID [2022-04-27 11:35:56,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {1276#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 2))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {1277#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1269#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1269#false} ~k~0 := ~j~0; {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L272 TraceCheckUtils]: 15: Hoare triple {1269#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {1269#false} ~cond := #in~cond; {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {1269#false} assume 0 == ~cond; {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2022-04-27 11:35:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:35:56,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:35:56,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906643234] [2022-04-27 11:35:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906643234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:35:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857300607] [2022-04-27 11:35:56,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:35:56,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:35:56,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:35:56,241 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-27 11:35:56,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process