/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-34549b5 [2022-04-07 12:12:46,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:12:46,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:12:46,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:12:46,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:12:46,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:12:46,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:12:46,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:12:46,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:12:46,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:12:46,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:12:46,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:12:46,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:12:46,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:12:46,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:12:46,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:12:46,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:12:46,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:12:46,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:12:46,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:12:46,883 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:12:46,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:12:46,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:12:46,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:12:46,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:12:46,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:12:46,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:12:46,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:12:46,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:12:46,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:12:46,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:12:46,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:12:46,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:12:46,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:12:46,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:12:46,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:12:46,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:12:46,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:12:46,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:12:46,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:12:46,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:12:46,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:12:46,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:12:46,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:12:46,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:12:46,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:12:46,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:12:46,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:12:46,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:12:46,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:12:46,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:12:46,938 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:12:46,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:12:46,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:12:46,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:12:46,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:12:46,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:12:46,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:12:46,941 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:12:46,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:12:46,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:12:46,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 12:12:47,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:12:47,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:12:47,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:12:47,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:12:47,225 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:12:47,226 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-07 12:12:47,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71633e38f/b041f82ef3754114b1e8a18e03ea48ca/FLAGf9b59bfff [2022-04-07 12:12:47,637 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:12:47,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-07 12:12:47,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71633e38f/b041f82ef3754114b1e8a18e03ea48ca/FLAGf9b59bfff [2022-04-07 12:12:48,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71633e38f/b041f82ef3754114b1e8a18e03ea48ca [2022-04-07 12:12:48,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:12:48,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:12:48,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:12:48,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:12:48,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:12:48,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cde434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48, skipping insertion in model container [2022-04-07 12:12:48,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:12:48,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:12:48,207 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-07 12:12:48,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:12:48,223 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:12:48,231 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-07 12:12:48,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:12:48,243 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:12:48,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48 WrapperNode [2022-04-07 12:12:48,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:12:48,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:12:48,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:12:48,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:12:48,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:12:48,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:12:48,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:12:48,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:12:48,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (1/1) ... [2022-04-07 12:12:48,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:12:48,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:12:48,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 12:12:48,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 12:12:48,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:12:48,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:12:48,312 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:12:48,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:12:48,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:12:48,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:12:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:12:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:12:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:12:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:12:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:12:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:12:48,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 12:12:48,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:12:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:12:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:12:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:12:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:12:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:12:48,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:12:48,366 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:12:48,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:12:48,491 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:12:48,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:12:48,496 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 12:12:48,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:12:48 BoogieIcfgContainer [2022-04-07 12:12:48,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:12:48,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:12:48,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:12:48,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:12:48,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:12:48" (1/3) ... [2022-04-07 12:12:48,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43187988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:12:48, skipping insertion in model container [2022-04-07 12:12:48,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:12:48" (2/3) ... [2022-04-07 12:12:48,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43187988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:12:48, skipping insertion in model container [2022-04-07 12:12:48,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:12:48" (3/3) ... [2022-04-07 12:12:48,502 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-04-07 12:12:48,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:12:48,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:12:48,534 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:12:48,539 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:12:48,539 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:12:48,554 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-07 12:12:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 12:12:48,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:12:48,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:12:48,562 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:12:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:12:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-04-07 12:12:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:12:48,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005283760] [2022-04-07 12:12:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:12:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:12:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:12:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:48,731 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-07 12:12:48,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-07 12:12:48,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-07 12:12:48,733 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-07 12:12:48,733 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-07 12:12:48,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-07 12:12:48,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-07 12:12:48,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-07 12:12:48,734 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-07 12:12:48,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {27#true} is VALID [2022-04-07 12:12:48,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-07 12:12:48,734 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-07 12:12:48,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-07 12:12:48,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} ~k~0 := ~j~0; {27#true} is VALID [2022-04-07 12:12:48,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-07 12:12:48,736 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-07 12:12:48,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-07 12:12:48,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-07 12:12:48,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-07 12:12:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:12:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:12:48,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005283760] [2022-04-07 12:12:48,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005283760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:12:48,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:12:48,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:12:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067977848] [2022-04-07 12:12:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:12:48,743 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-07 12:12:48,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:12:48,746 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-07 12:12:48,766 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-07 12:12:48,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:12:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:12:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:12:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:12:48,781 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-07 12:12:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:48,860 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-07 12:12:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:12:48,861 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-07 12:12:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:12:48,862 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-07 12:12:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-07 12:12:48,870 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-07 12:12:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-07 12:12:48,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-07 12:12:48,939 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-07 12:12:48,948 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:12:48,948 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 12:12:48,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:12:48,955 INFO L913 BasicCegarLoop]: 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-07 12:12:48,956 INFO L914 BasicCegarLoop]: 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-07 12:12:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 12:12:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-07 12:12:48,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:12:48,986 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-07 12:12:48,987 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-07 12:12:48,987 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-07 12:12:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:48,996 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 12:12:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 12:12:48,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:48,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:48,997 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-07 12:12:48,997 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-07 12:12:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:48,999 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 12:12:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 12:12:49,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:49,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:49,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:12:49,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:12:49,001 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-07 12:12:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 12:12:49,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-07 12:12:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:12:49,008 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 12:12:49,010 INFO L479 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-07 12:12:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 12:12:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 12:12:49,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:12:49,011 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:12:49,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:12:49,011 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:12:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:12:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-04-07 12:12:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:12:49,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741589580] [2022-04-07 12:12:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:12:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:12:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:12:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:49,491 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-07 12:12:49,492 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-07 12:12:49,493 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-07 12:12:49,493 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-07 12:12:49,494 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-07 12:12:49,496 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-07 12:12:49,496 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-07 12:12:49,497 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-07 12:12:49,497 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-07 12:12:49,498 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-07 12:12:49,499 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-07 12:12:49,500 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-07 12:12:49,500 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-07 12:12:49,502 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-07 12:12:49,504 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-07 12:12:49,506 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-07 12:12:49,506 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-07 12:12:49,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {158#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {149#false} is VALID [2022-04-07 12:12:49,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-04-07 12:12:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:12:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:12:49,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741589580] [2022-04-07 12:12:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741589580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:12:49,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:12:49,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 12:12:49,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257020315] [2022-04-07 12:12:49,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:12:49,510 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-07 12:12:49,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:12:49,511 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-07 12:12:49,532 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-07 12:12:49,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:12:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:12:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:12:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:12:49,535 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-07 12:12:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:49,963 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-07 12:12:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:12:49,964 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-07 12:12:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:12:49,965 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-07 12:12:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-07 12:12:49,968 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-07 12:12:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-07 12:12:49,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-07 12:12:50,018 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-07 12:12:50,020 INFO L225 Difference]: With dead ends: 33 [2022-04-07 12:12:50,020 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 12:12:50,023 INFO L912 BasicCegarLoop]: 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-07 12:12:50,025 INFO L913 BasicCegarLoop]: 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-07 12:12:50,025 INFO L914 BasicCegarLoop]: 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-07 12:12:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 12:12:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-07 12:12:50,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:12:50,045 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-07 12:12:50,045 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-07 12:12:50,045 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-07 12:12:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,047 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-07 12:12:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-07 12:12:50,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:50,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:50,048 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-07 12:12:50,049 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-07 12:12:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,050 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-07 12:12:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-07 12:12:50,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:50,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:50,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:12:50,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:12:50,052 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-07 12:12:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-07 12:12:50,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-07 12:12:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:12:50,056 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-07 12:12:50,056 INFO L479 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-07 12:12:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-07 12:12:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:12:50,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:12:50,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:12:50,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:12:50,058 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:12:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:12:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-04-07 12:12:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:12:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931818434] [2022-04-07 12:12:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:12:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:12:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:12:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:50,189 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-07 12:12:50,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-07 12:12:50,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #75#return; {316#true} is VALID [2022-04-07 12:12:50,190 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-07 12:12:50,190 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-07 12:12:50,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-07 12:12:50,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #75#return; {316#true} is VALID [2022-04-07 12:12:50,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret5 := main(); {316#true} is VALID [2022-04-07 12:12:50,190 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-07 12:12:50,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {316#true} is VALID [2022-04-07 12:12:50,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {316#true} is VALID [2022-04-07 12:12:50,194 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-07 12:12:50,195 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-07 12:12:50,196 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-07 12:12:50,196 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-07 12:12:50,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {317#false} is VALID [2022-04-07 12:12:50,199 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-07 12:12:50,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2022-04-07 12:12:50,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2022-04-07 12:12:50,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-07 12:12:50,202 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-07 12:12:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:12:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931818434] [2022-04-07 12:12:50,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931818434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:12:50,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:12:50,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:12:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742023148] [2022-04-07 12:12:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:12:50,204 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-07 12:12:50,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:12:50,204 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-07 12:12:50,216 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-07 12:12:50,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:12:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:12:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:12:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:12:50,217 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-07 12:12:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,326 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-07 12:12:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:12:50,327 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-07 12:12:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:12:50,327 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-07 12:12:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-07 12:12:50,329 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-07 12:12:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-07 12:12:50,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-07 12:12:50,349 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-07 12:12:50,351 INFO L225 Difference]: With dead ends: 28 [2022-04-07 12:12:50,351 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 12:12:50,351 INFO L912 BasicCegarLoop]: 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-07 12:12:50,356 INFO L913 BasicCegarLoop]: 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-07 12:12:50,357 INFO L914 BasicCegarLoop]: 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-07 12:12:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 12:12:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-07 12:12:50,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:12:50,372 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-07 12:12:50,372 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-07 12:12:50,372 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-07 12:12:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,374 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-07 12:12:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-07 12:12:50,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:50,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:50,375 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-07 12:12:50,376 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-07 12:12:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,377 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-07 12:12:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-07 12:12:50,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:50,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:50,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:12:50,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:12:50,377 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-07 12:12:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-07 12:12:50,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-07 12:12:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:12:50,381 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-07 12:12:50,381 INFO L479 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-07 12:12:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-07 12:12:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:12:50,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:12:50,383 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:12:50,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 12:12:50,383 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:12:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:12:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1916237745, now seen corresponding path program 1 times [2022-04-07 12:12:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:12:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752381294] [2022-04-07 12:12:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:12:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:12:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:12:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:50,459 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-07 12:12:50,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume true; {444#true} is VALID [2022-04-07 12:12:50,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} #75#return; {444#true} is VALID [2022-04-07 12:12:50,460 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-07 12:12:50,460 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-07 12:12:50,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} assume true; {444#true} is VALID [2022-04-07 12:12:50,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {444#true} {444#true} #75#return; {444#true} is VALID [2022-04-07 12:12:50,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {444#true} call #t~ret5 := main(); {444#true} is VALID [2022-04-07 12:12:50,461 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-07 12:12:50,461 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-07 12:12:50,462 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-07 12:12:50,462 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-07 12:12:50,463 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-07 12:12:50,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {445#false} is VALID [2022-04-07 12:12:50,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#false} ~k~0 := ~j~0; {445#false} is VALID [2022-04-07 12:12:50,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {445#false} is VALID [2022-04-07 12:12:50,463 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-07 12:12:50,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {445#false} ~cond := #in~cond; {445#false} is VALID [2022-04-07 12:12:50,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#false} assume 0 == ~cond; {445#false} is VALID [2022-04-07 12:12:50,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-04-07 12:12:50,464 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-07 12:12:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:12:50,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752381294] [2022-04-07 12:12:50,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752381294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:12:50,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:12:50,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:12:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964345007] [2022-04-07 12:12:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:12:50,465 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-07 12:12:50,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:12:50,465 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-07 12:12:50,476 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-07 12:12:50,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:12:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:12:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:12:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:12:50,477 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-07 12:12:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,585 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-07 12:12:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:12:50,586 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-07 12:12:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:12:50,586 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-07 12:12:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 12:12:50,588 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-07 12:12:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 12:12:50,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-07 12:12:50,616 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-07 12:12:50,617 INFO L225 Difference]: With dead ends: 28 [2022-04-07 12:12:50,617 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 12:12:50,617 INFO L912 BasicCegarLoop]: 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-07 12:12:50,621 INFO L913 BasicCegarLoop]: 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-07 12:12:50,622 INFO L914 BasicCegarLoop]: 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-07 12:12:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 12:12:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 12:12:50,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:12:50,639 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-07 12:12:50,639 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-07 12:12:50,639 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-07 12:12:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,640 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-07 12:12:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 12:12:50,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:50,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:50,641 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-07 12:12:50,641 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-07 12:12:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:12:50,642 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-07 12:12:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 12:12:50,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:12:50,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:12:50,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:12:50,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:12:50,645 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-07 12:12:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-07 12:12:50,646 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2022-04-07 12:12:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:12:50,646 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-07 12:12:50,646 INFO L479 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-07 12:12:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 12:12:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:12:50,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:12:50,647 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:12:50,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 12:12:50,647 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:12:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:12:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 1 times [2022-04-07 12:12:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:12:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872960944] [2022-04-07 12:12:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:12:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:12:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:12:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:51,406 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-07 12:12:51,406 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-07 12:12:51,407 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-07 12:12:51,407 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-07 12:12:51,408 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-07 12:12:51,408 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-07 12:12:51,409 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-07 12:12:51,409 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-07 12:12:51,409 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-07 12:12:51,410 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-07 12:12:51,411 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-07 12:12:51,411 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-07 12:12:51,412 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-07 12:12:51,413 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-07 12:12:51,417 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-07 12:12:51,418 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-07 12:12:51,421 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-07 12:12:51,421 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-07 12:12:51,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {576#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {566#false} is VALID [2022-04-07 12:12:51,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-07 12:12:51,422 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-07 12:12:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:12:51,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872960944] [2022-04-07 12:12:51,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872960944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:12:51,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982508351] [2022-04-07 12:12:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:12:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:12:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:12:51,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:12:51,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 12:12:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:51,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 12:12:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:12:51,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:12:52,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-07 12:12:52,545 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-07 12:12:52,546 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-07 12:12:52,546 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-07 12:12:52,548 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-07 12:12:52,550 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-07 12:12:52,550 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-07 12:12:52,551 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-07 12:12:52,551 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-07 12:12:52,552 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-07 12:12:52,552 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-07 12:12:52,553 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-07 12:12:52,554 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-07 12:12:52,555 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-07 12:12:52,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:12:52,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-07 12:12:52,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-07 12:12:52,557 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-07 12:12:52,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:12:59,015 WARN L833 $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 false [2022-04-07 12:13:01,095 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-07 12:13:09,500 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~i~0 4294967296))) (or (<= (mod (div (mod (+ (* .cse0 2) c_main_~i~0) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)) (< .cse0 (mod c_main_~n~0 4294967296)))) is different from true [2022-04-07 12:13:11,624 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~n~0 4294967296)) (.cse1 (mod (+ c_main_~i~0 1) 4294967296))) (or (not (< (mod c_main_~i~0 4294967296) .cse0)) (< .cse1 .cse0) (<= (mod (div (mod (+ c_main_~i~0 (* .cse1 2) 1) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)))) is different from true [2022-04-07 12:13:12,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-07 12:13:12,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-07 12:13:12,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:13:12,031 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-07 12:13:12,032 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-07 12:13:12,032 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-07 12:13:12,032 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-07 12:13:14,145 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-07 12:13:14,146 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-07 12:13:16,246 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-07 12:13:16,247 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-07 12:13:16,247 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-07 12:13:16,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret5 := main(); {565#true} is VALID [2022-04-07 12:13:16,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #75#return; {565#true} is VALID [2022-04-07 12:13:16,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-07 12:13:16,247 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-07 12:13:16,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-07 12:13:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-07 12:13:16,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982508351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:13:16,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:13:16,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-04-07 12:13:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501478353] [2022-04-07 12:13:16,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:13:16,249 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-07 12:13:16,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:13:16,249 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-07 12:13:21,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:13:21,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 12:13:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:13:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 12:13:21,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=284, Unknown=4, NotChecked=108, Total=462 [2022-04-07 12:13:21,269 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-07 12:13:28,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:32,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:35,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:41,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:44,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:46,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:48,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:50,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:13:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:13:51,251 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-07 12:13:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 12:13:51,252 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-07 12:13:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:13:51,252 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-07 12:13:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-07 12:13:51,253 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-07 12:13:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-07 12:13:51,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-07 12:13:53,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:13:53,539 INFO L225 Difference]: With dead ends: 36 [2022-04-07 12:13:53,539 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 12:13:53,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=155, Invalid=609, Unknown=4, NotChecked=162, Total=930 [2022-04-07 12:13:53,540 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 22 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-04-07 12:13:53,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 35 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 147 Invalid, 8 Unknown, 64 Unchecked, 16.9s Time] [2022-04-07 12:13:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 12:13:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-04-07 12:13:53,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:13:53,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:13:53,583 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:13:53,584 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:13:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:13:53,585 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 12:13:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 12:13:53,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:13:53,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:13:53,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-07 12:13:53,585 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-07 12:13:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:13:53,586 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 12:13:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 12:13:53,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:13:53,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:13:53,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:13:53,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:13:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:13:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-07 12:13:53,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-07 12:13:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:13:53,587 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-07 12:13:53,587 INFO L479 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-07 12:13:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-07 12:13:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 12:13:53,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:13:53,587 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:13:53,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 12:13:53,792 WARN L460 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-07 12:13:53,792 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:13:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:13:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1534967211, now seen corresponding path program 2 times [2022-04-07 12:13:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:13:53,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637815443] [2022-04-07 12:13:53,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:13:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:13:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:13:57,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:13:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:13:57,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#(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; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {856#true} #75#return; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {870#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:13:57,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#(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; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {856#true} #75#return; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 12:13:57,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {861#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {862#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-07 12:13:57,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) (div main_~i~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {863#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= (+ (* (div ~SIZE~0 4294967296) 4294967296) 1) main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-07 12:13:57,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {863#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= (+ (* (div ~SIZE~0 4294967296) 4294967296) 1) main_~i~0) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {864#(and (<= (+ 19999999 main_~i~0) ~SIZE~0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))} is VALID [2022-04-07 12:13:57,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {864#(and (<= (+ 19999999 main_~i~0) ~SIZE~0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {864#(and (<= (+ 19999999 main_~i~0) ~SIZE~0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))} is VALID [2022-04-07 12:13:57,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {864#(and (<= (+ 19999999 main_~i~0) ~SIZE~0) (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {865#(and (or (<= 4294967297 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296)) (- 4294967302)) 4294967296) 4294967296) main_~i~0)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (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 (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3))))} is VALID [2022-04-07 12:13:57,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {865#(and (or (<= 4294967297 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296)) (- 4294967302)) 4294967296) 4294967296) main_~i~0)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (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 (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3))))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {865#(and (or (<= 4294967297 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296)) (- 4294967302)) 4294967296) 4294967296) main_~i~0)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (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 (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3))))} is VALID [2022-04-07 12:13:57,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {865#(and (or (<= 4294967297 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296)) (- 4294967302)) 4294967296) 4294967296) main_~i~0)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 1 (+ (* (div (+ main_~n~0 (* (div ~SIZE~0 4294967296) (- 12884901888)) (- 6) (* main_~i~0 2) (* (div main_~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~i~0)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (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 (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3))))} ~k~0 := ~j~0; {866#(and (or (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))) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3)))) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= (+ 4294967302 (* (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) 12884901888) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* (div main_~i~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~k~0 4294967296) 4294967296) (* main_~i~0 2)))) (<= (+ (* (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) 12884901888) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 8589934598 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~k~0 4294967296) 4294967296) (* main_~i~0 2)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (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))))} is VALID [2022-04-07 12:13:57,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#(and (or (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))) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3)))) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= (+ 4294967302 (* (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) 12884901888) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* (div main_~i~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~k~0 4294967296) 4294967296) (* main_~i~0 2)))) (<= (+ (* (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) 12884901888) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) 8589934598 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~k~0 4294967296) 4294967296) (* main_~i~0 2)))) (< 0 (+ (div main_~i~0 4294967296) 1)) (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))))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {867#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (* 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 (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)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3))))} is VALID [2022-04-07 12:13:57,632 INFO L272 TraceCheckUtils]: 14: Hoare triple {867#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (* 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 (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)) (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934595 (* ~SIZE~0 3)))) (<= (+ (* main_~i~0 3) 59999997) (* ~SIZE~0 3))))} 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)); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:13:57,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {869#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:13:57,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {857#false} is VALID [2022-04-07 12:13:57,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-04-07 12:13:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:13:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:13:57,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637815443] [2022-04-07 12:13:57,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637815443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:13:57,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113160115] [2022-04-07 12:13:57,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:13:57,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:13:57,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:13:57,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:13:57,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 12:13:57,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:13:57,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:13:57,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 12:13:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:13:57,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:13:59,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {856#true} is VALID [2022-04-07 12:13:59,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#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; {856#true} is VALID [2022-04-07 12:13:59,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2022-04-07 12:13:59,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #75#return; {856#true} is VALID [2022-04-07 12:13:59,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret5 := main(); {856#true} is VALID [2022-04-07 12:13:59,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {856#true} is VALID [2022-04-07 12:13:59,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {892#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-07 12:13:59,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {892#(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; {896#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 12:13:59,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {896#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {900#(and (< 1 (mod main_~n~0 4294967296)) (= main_~i~0 2) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-07 12:13:59,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(and (< 1 (mod main_~n~0 4294967296)) (= main_~i~0 2) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {904#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 12:13:59,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {904#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {908#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-07 12:13:59,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {908#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= (mod main_~i~0 4294967296) main_~j~0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {908#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-07 12:13:59,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {908#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= (mod main_~i~0 4294967296) main_~j~0))} ~k~0 := ~j~0; {915#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-07 12:13:59,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {915#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 1)) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-07 12:13:59,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {915#(and (= main_~i~0 2) (< (div (+ (mod ~SIZE~0 4294967296) (- 2)) (- 4294967296)) (+ (div (mod main_~i~0 4294967296) 4294967296) 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)); {922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:13:59,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:13:59,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {857#false} is VALID [2022-04-07 12:13:59,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-04-07 12:13:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:13:59,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:14:43,185 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~i~0 4294967296))) (or (<= (mod (div (mod (+ (* .cse0 2) c_main_~i~0) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)) (< .cse0 (mod c_main_~n~0 4294967296)))) is different from true [2022-04-07 12:15:00,391 WARN L232 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:15:06,887 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~n~0 4294967296)) (.cse1 (mod (+ c_main_~i~0 2) 4294967296))) (or (not (< (mod (+ c_main_~i~0 1) 4294967296) .cse0)) (< .cse1 .cse0) (<= (mod (div (mod (+ c_main_~i~0 2 (* 2 .cse1)) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)))) is different from true [2022-04-07 12:15:07,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-04-07 12:15:07,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {857#false} is VALID [2022-04-07 12:15:07,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:15:07,724 INFO L272 TraceCheckUtils]: 14: Hoare triple {942#(<= (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)); {922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:15:07,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {942#(<= (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); {942#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:15:07,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} ~k~0 := ~j~0; {942#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:15:07,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {949#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {949#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:15:09,915 WARN L290 TraceCheckUtils]: 10: Hoare triple {956#(<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 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); {949#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is UNKNOWN [2022-04-07 12:15:09,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(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); {956#(<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:15:12,075 WARN L290 TraceCheckUtils]: 8: Hoare triple {964#(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; {960#(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-07 12:15:14,316 WARN L290 TraceCheckUtils]: 7: Hoare triple {968#(or (< (mod (+ main_~i~0 2) 4294967296) (mod main_~n~0 4294967296)) (<= (mod (div (mod (+ main_~i~0 2 (* (mod (+ main_~i~0 2) 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {964#(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 UNKNOWN [2022-04-07 12:15:14,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {968#(or (< (mod (+ main_~i~0 2) 4294967296) (mod main_~n~0 4294967296)) (<= (mod (div (mod (+ main_~i~0 2 (* (mod (+ main_~i~0 2) 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-07 12:15:14,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {856#true} is VALID [2022-04-07 12:15:14,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret5 := main(); {856#true} is VALID [2022-04-07 12:15:14,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #75#return; {856#true} is VALID [2022-04-07 12:15:14,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2022-04-07 12:15:14,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#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; {856#true} is VALID [2022-04-07 12:15:14,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {856#true} is VALID [2022-04-07 12:15:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-04-07 12:15:14,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113160115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:15:14,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:15:14,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-04-07 12:15:14,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497864853] [2022-04-07 12:15:14,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:15:14,319 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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 18 [2022-04-07 12:15:14,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:15:14,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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-07 12:15:25,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 39 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-07 12:15:25,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 12:15:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:15:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 12:15:25,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=467, Unknown=20, NotChecked=90, Total=650 [2022-04-07 12:15:25,189 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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-07 12:15:27,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:29,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:31,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:33,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:43,249 WARN L232 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 42 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:15:45,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:47,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:49,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:51,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:15:54,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:05,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:09,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:11,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:13,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:16,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:18,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:20,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:22,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:24,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:27,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:29,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:16:56,085 WARN L232 SmtUtils]: Spent 15.30s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:16:58,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:17:00,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:17:02,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:17:04,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:17:09,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:17:11,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:17:44,985 WARN L232 SmtUtils]: Spent 22.16s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:17:53,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:00,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:02,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:04,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:06,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:11,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:13,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:15,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:17,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:19,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:22,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:24,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:26,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:30,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:33,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:37,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:39,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:42,089 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~i~0 4294967296)) (.cse3 (mod c_~SIZE~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod c_main_~n~0 4294967296)) (.cse2 (mod (+ c_main_~i~0 1) 4294967296))) (or (not (< .cse0 .cse1)) (< .cse2 .cse1) (<= (mod (div (mod (+ c_main_~i~0 (* .cse2 2) 1) 4294967296) 3) 4294967296) .cse3))) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ (* .cse0 2) c_main_~i~0) 4294967296) 3) 4294967296) .cse3) (<= (mod (div (mod (+ c_main_~i~0 (* 2 c_main_~j~0)) 4294967296) 3) 4294967296) .cse3) (<= 20000001 c_~SIZE~0) (<= (mod (div (mod (+ c_main_~i~0 c_main_~j~0 c_main_~k~0) 4294967296) 3) 4294967296) .cse3) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-04-07 12:18:46,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:48,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:50,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:53,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:55,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:18:59,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:02,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:19:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:08,968 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-07 12:19:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-07 12:19:08,968 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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 18 [2022-04-07 12:19:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:19:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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-07 12:19:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-07 12:19:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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-07 12:19:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-07 12:19:08,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 59 transitions. [2022-04-07 12:19:13,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 57 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:19:13,410 INFO L225 Difference]: With dead ends: 52 [2022-04-07 12:19:13,410 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 12:19:13,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 141.6s TimeCoverageRelationStatistics Valid=237, Invalid=1225, Unknown=32, NotChecked=228, Total=1722 [2022-04-07 12:19:13,411 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 151 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 46 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 107.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:19:13,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 41 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 292 Invalid, 50 Unknown, 85 Unchecked, 107.0s Time] [2022-04-07 12:19:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 12:19:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2022-04-07 12:19:13,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:19:13,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 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-07 12:19:13,475 INFO L74 IsIncluded]: Start isIncluded. First operand 40 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-07 12:19:13,475 INFO L87 Difference]: Start difference. First operand 40 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-07 12:19:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:13,478 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-07 12:19:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-07 12:19:13,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:13,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:13,479 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 40 states. [2022-04-07 12:19:13,479 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 40 states. [2022-04-07 12:19:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:19:13,483 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-07 12:19:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-07 12:19:13,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:19:13,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:19:13,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:19:13,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:19:13,484 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-07 12:19:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-07 12:19:13,484 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-04-07 12:19:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:19:13,485 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-07 12:19:13,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 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-07 12:19:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 12:19:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 12:19:13,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:19:13,485 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:19:13,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 12:19:13,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-07 12:19:13,703 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:19:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:19:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1604375314, now seen corresponding path program 1 times [2022-04-07 12:19:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:19:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007455711] [2022-04-07 12:19:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:19:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:19:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:13,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {1240#(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; {1231#true} is VALID [2022-04-07 12:19:13,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {1231#true} assume true; {1231#true} is VALID [2022-04-07 12:19:13,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1231#true} {1231#true} #75#return; {1231#true} is VALID [2022-04-07 12:19:13,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {1231#true} call ULTIMATE.init(); {1240#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:19:13,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#(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; {1231#true} is VALID [2022-04-07 12:19:13,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#true} assume true; {1231#true} is VALID [2022-04-07 12:19:13,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1231#true} {1231#true} #75#return; {1231#true} is VALID [2022-04-07 12:19:13,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {1231#true} call #t~ret5 := main(); {1231#true} is VALID [2022-04-07 12:19:13,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {1231#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1231#true} is VALID [2022-04-07 12:19:13,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {1236#(= main_~i~0 0)} is VALID [2022-04-07 12:19:13,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {1237#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-07 12:19:13,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1237#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1238#(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-07 12:19:13,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {1238#(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); {1239#(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-07 12:19:13,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(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; {1232#false} is VALID [2022-04-07 12:19:13,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {1232#false} assume !!(~j~0 % 4294967296 < ~n~0 % 4294967296);~j~0 := 1 + ~j~0; {1232#false} is VALID [2022-04-07 12:19:13,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {1232#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {1232#false} is VALID [2022-04-07 12:19:13,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {1232#false} ~k~0 := ~j~0; {1232#false} is VALID [2022-04-07 12:19:13,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1232#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {1232#false} is VALID [2022-04-07 12:19:13,885 INFO L272 TraceCheckUtils]: 15: Hoare triple {1232#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)); {1232#false} is VALID [2022-04-07 12:19:13,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {1232#false} ~cond := #in~cond; {1232#false} is VALID [2022-04-07 12:19:13,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1232#false} assume 0 == ~cond; {1232#false} is VALID [2022-04-07 12:19:13,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {1232#false} assume !false; {1232#false} is VALID [2022-04-07 12:19:13,886 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-07 12:19:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:19:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007455711] [2022-04-07 12:19:13,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007455711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:19:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35058622] [2022-04-07 12:19:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:19:13,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:19:13,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:19:13,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:19:13,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 12:19:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:13,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:19:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:19:13,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:19:16,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {1231#true} call ULTIMATE.init(); {1231#true} is VALID [2022-04-07 12:19:16,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1231#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; {1231#true} is VALID [2022-04-07 12:19:16,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#true} assume true; {1231#true} is VALID [2022-04-07 12:19:16,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1231#true} {1231#true} #75#return; {1231#true} is VALID [2022-04-07 12:19:16,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {1231#true} call #t~ret5 := main(); {1231#true} is VALID [2022-04-07 12:19:16,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {1231#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1231#true} is VALID [2022-04-07 12:19:16,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {1262#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-07 12:19:16,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#(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; {1266#(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-07 12:19:16,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(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); {1270#(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-07 12:19:16,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#(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); {1274#(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-07 12:19:16,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(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; {1278#(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-07 12:19:16,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {1278#(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; {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {1232#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {1232#false} ~k~0 := ~j~0; {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {1232#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L272 TraceCheckUtils]: 15: Hoare triple {1232#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)); {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {1232#false} ~cond := #in~cond; {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {1232#false} assume 0 == ~cond; {1232#false} is VALID [2022-04-07 12:19:16,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {1232#false} assume !false; {1232#false} is VALID [2022-04-07 12:19:16,478 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-07 12:19:16,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:19:59,340 WARN L232 SmtUtils]: Spent 9.41s 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-07 12:20:03,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {1232#false} assume !false; {1232#false} is VALID [2022-04-07 12:20:03,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1232#false} is VALID [2022-04-07 12:20:03,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {1310#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1306#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:20:03,681 INFO L272 TraceCheckUtils]: 15: Hoare triple {1314#(<= (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)); {1310#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:20:03,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {1314#(<= (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); {1314#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:20:03,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {1321#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} ~k~0 := ~j~0; {1314#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:20:03,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {1321#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-07 12:20:05,832 WARN L290 TraceCheckUtils]: 11: Hoare triple {1328#(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; {1321#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is UNKNOWN [2022-04-07 12:20:08,030 WARN L290 TraceCheckUtils]: 10: Hoare triple {1332#(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; {1328#(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 UNKNOWN [2022-04-07 12:20:10,233 WARN L290 TraceCheckUtils]: 9: Hoare triple {1336#(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); {1332#(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-07 12:20:10,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {1231#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1336#(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-07 12:20:10,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#true} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {1231#true} is VALID [2022-04-07 12:20:10,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {1231#true} is VALID [2022-04-07 12:20:10,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {1231#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1231#true} is VALID [2022-04-07 12:20:10,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {1231#true} call #t~ret5 := main(); {1231#true} is VALID [2022-04-07 12:20:10,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1231#true} {1231#true} #75#return; {1231#true} is VALID [2022-04-07 12:20:10,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#true} assume true; {1231#true} is VALID [2022-04-07 12:20:10,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1231#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; {1231#true} is VALID [2022-04-07 12:20:10,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {1231#true} call ULTIMATE.init(); {1231#true} is VALID [2022-04-07 12:20:10,239 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-07 12:20:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35058622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:20:10,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:20:10,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2022-04-07 12:20:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080143350] [2022-04-07 12:20:10,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:20:10,240 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-07 12:20:10,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:20:10,240 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-07 12:20:14,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:20:14,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 12:20:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:20:14,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 12:20:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=264, Unknown=6, NotChecked=0, Total=342 [2022-04-07 12:20:14,571 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-07 12:20:20,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:23,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:25,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:27,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:29,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:32,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:34,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:46,115 WARN L232 SmtUtils]: Spent 8.69s 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-07 12:20:48,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:52,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:20:54,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:12,122 WARN L232 SmtUtils]: Spent 6.58s 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-07 12:21:14,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:16,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:29,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:31,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:38,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:40,294 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:42,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:21:57,916 WARN L232 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:21:59,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:02,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:06,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:08,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:10,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:13,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:15,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:48,150 WARN L232 SmtUtils]: Spent 23.85s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:22:50,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:52,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:54,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:56,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:22:58,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:46,912 WARN L232 SmtUtils]: Spent 32.62s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:23:49,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:51,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:53,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:55,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:57,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:23:59,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:42,114 WARN L232 SmtUtils]: Spent 35.54s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:24:46,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:24:53,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:23,924 WARN L232 SmtUtils]: Spent 10.97s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:25:28,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:30,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:32,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:34,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:37,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:39,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:41,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:43,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:46,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:50,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:52,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:25:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:55,248 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-07 12:25:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 12:25:55,248 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-07 12:25:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:55,248 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-07 12:25:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-07 12:25:55,249 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-07 12:25:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-07 12:25:55,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 45 transitions. [2022-04-07 12:26:01,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 12:26:01,866 INFO L225 Difference]: With dead ends: 45 [2022-04-07 12:26:01,866 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 12:26:01,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 230.8s TimeCoverageRelationStatistics Valid=195, Invalid=822, Unknown=39, NotChecked=0, Total=1056 [2022-04-07 12:26:01,866 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 18 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:26:01,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 54 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 205 Invalid, 48 Unknown, 0 Unchecked, 104.3s Time] [2022-04-07 12:26:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 12:26:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-07 12:26:01,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:26:01,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 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-07 12:26:01,935 INFO L74 IsIncluded]: Start isIncluded. First operand 29 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-07 12:26:01,935 INFO L87 Difference]: Start difference. First operand 29 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-07 12:26:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:01,936 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-07 12:26:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-07 12:26:01,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:26:01,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:26:01,936 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 29 states. [2022-04-07 12:26:01,936 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 29 states. [2022-04-07 12:26:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:26:01,937 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-07 12:26:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-07 12:26:01,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:26:01,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:26:01,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:26:01,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:26:01,937 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-07 12:26:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-07 12:26:01,938 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2022-04-07 12:26:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:26:01,938 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-07 12:26:01,938 INFO L479 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-07 12:26:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-07 12:26:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 12:26:01,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:26:01,938 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:26:01,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 12:26:02,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:26:02,151 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:26:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:26:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1723225391, now seen corresponding path program 2 times [2022-04-07 12:26:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:26:02,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073348444] [2022-04-07 12:26:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:26:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:26:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:02,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:26:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:26:02,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {1578#(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; {1568#true} is VALID [2022-04-07 12:26:02,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#true} assume true; {1568#true} is VALID [2022-04-07 12:26:02,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1568#true} {1568#true} #75#return; {1568#true} is VALID [2022-04-07 12:26:02,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1578#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:26:02,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {1578#(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; {1568#true} is VALID [2022-04-07 12:26:02,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {1568#true} assume true; {1568#true} is VALID [2022-04-07 12:26:02,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1568#true} {1568#true} #75#return; {1568#true} is VALID [2022-04-07 12:26:02,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {1568#true} call #t~ret5 := main(); {1568#true} is VALID [2022-04-07 12:26:02,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {1568#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1568#true} is VALID [2022-04-07 12:26:02,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {1568#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {1573#(= main_~i~0 0)} is VALID [2022-04-07 12:26:02,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {1573#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {1574#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-07 12:26:02,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 1 + ~i~0; {1575#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-07 12:26:02,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {1575#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {1576#(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-07 12:26:02,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {1576#(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); {1577#(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-07 12:26:02,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {1577#(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; {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {1569#false} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {1569#false} ~k~0 := ~j~0; {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {1569#false} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L272 TraceCheckUtils]: 15: Hoare triple {1569#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)); {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-07 12:26:02,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-07 12:26:02,349 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-07 12:26:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:26:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073348444] [2022-04-07 12:26:02,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073348444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:26:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795023688] [2022-04-07 12:26:02,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:26:02,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:26:02,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:26:02,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:26:02,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process