/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:21:06,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:21:06,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:21:06,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:21:06,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:21:06,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:21:06,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:21:06,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:21:06,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:21:06,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:21:06,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:21:06,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:21:06,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:21:06,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:21:06,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:21:06,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:21:06,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:21:06,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:21:06,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:21:06,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:21:06,800 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:21:06,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:21:06,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:21:06,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:21:06,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:21:06,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:21:06,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:21:06,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:21:06,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:21:06,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:21:06,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:21:06,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:21:06,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:21:06,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:21:06,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:21:06,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:21:06,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:21:06,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:21:06,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:21:06,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:21:06,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:21:06,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:21:06,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:21:06,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:21:06,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:21:06,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:21:06,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:21:06,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:21:06,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:21:06,844 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:21:06,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:21:06,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:21:06,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:21:06,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:21:06,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:21:06,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:21:06,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:21:06,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:21:06,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:21:06,848 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:21:06,848 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-15 01:21:07,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:21:07,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:21:07,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:21:07,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:21:07,104 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:21:07,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-15 01:21:07,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9e3a011/d3b3ca3b81af4803bcfb9dee658727bb/FLAG1868b6787 [2022-04-15 01:21:07,516 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:21:07,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-15 01:21:07,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9e3a011/d3b3ca3b81af4803bcfb9dee658727bb/FLAG1868b6787 [2022-04-15 01:21:07,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9e3a011/d3b3ca3b81af4803bcfb9dee658727bb [2022-04-15 01:21:07,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:21:07,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:21:07,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:21:07,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:21:07,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:21:07,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:21:07" (1/1) ... [2022-04-15 01:21:07,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fa5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:07, skipping insertion in model container [2022-04-15 01:21:07,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:21:07" (1/1) ... [2022-04-15 01:21:07,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:21:07,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:21:08,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-15 01:21:08,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:21:08,202 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:21:08,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-15 01:21:08,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:21:08,243 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:21:08,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08 WrapperNode [2022-04-15 01:21:08,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:21:08,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:21:08,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:21:08,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:21:08,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:21:08,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:21:08,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:21:08,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:21:08,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (1/1) ... [2022-04-15 01:21:08,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:21:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:21:08,304 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-15 01:21:08,330 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-15 01:21:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:21:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:21:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:21:08,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 01:21:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:21:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:21:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:21:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:21:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:21:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:21:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:21:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:21:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:21:08,403 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:21:08,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:21:15,093 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:21:15,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:21:15,099 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:21:15,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:21:15 BoogieIcfgContainer [2022-04-15 01:21:15,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:21:15,101 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:21:15,101 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:21:15,102 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:21:15,104 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:21:15" (1/1) ... [2022-04-15 01:21:15,106 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:21:15,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:21:15 BasicIcfg [2022-04-15 01:21:15,130 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:21:15,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:21:15,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:21:15,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:21:15,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:21:07" (1/4) ... [2022-04-15 01:21:15,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e09071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:21:15, skipping insertion in model container [2022-04-15 01:21:15,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:21:08" (2/4) ... [2022-04-15 01:21:15,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e09071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:21:15, skipping insertion in model container [2022-04-15 01:21:15,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:21:15" (3/4) ... [2022-04-15 01:21:15,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e09071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:21:15, skipping insertion in model container [2022-04-15 01:21:15,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:21:15" (4/4) ... [2022-04-15 01:21:15,138 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.cqvasr [2022-04-15 01:21:15,142 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:21:15,143 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:21:15,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:21:15,182 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=FINITE_AUTOMATA, 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-15 01:21:15,183 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:21:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:21:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:21:15,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:21:15,209 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:21:15,209 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:21:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:21:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2096714442, now seen corresponding path program 1 times [2022-04-15 01:21:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:21:15,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167286130] [2022-04-15 01:21:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:21:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:21:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:15,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-15 01:21:15,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 01:21:15,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 01:21:15,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:21:15,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-15 01:21:15,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 01:21:15,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 01:21:15,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 01:21:15,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {29#true} is VALID [2022-04-15 01:21:15,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 01:21:15,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} [88] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 01:21:15,431 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {30#false} is VALID [2022-04-15 01:21:15,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-15 01:21:15,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 01:21:15,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 01:21:15,432 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-15 01:21:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:21:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167286130] [2022-04-15 01:21:15,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167286130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:21:15,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:21:15,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:21:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436148405] [2022-04-15 01:21:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:21:15,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:21:15,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:21:15,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:15,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:15,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:21:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:21:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:21:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:21:15,488 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:22,123 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 01:21:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:21:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:21:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:21:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 01:21:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 01:21:22,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 01:21:22,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:22,201 INFO L225 Difference]: With dead ends: 38 [2022-04-15 01:21:22,201 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 01:21:22,203 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-15 01:21:22,206 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:21:22,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:21:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 01:21:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 01:21:22,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:21:22,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,233 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,233 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:22,236 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 01:21:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 01:21:22,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:22,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:22,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 01:21:22,237 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 01:21:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:22,240 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 01:21:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 01:21:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:22,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:21:22,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:21:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-15 01:21:22,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-15 01:21:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:21:22,244 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-15 01:21:22,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 01:21:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:21:22,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:21:22,245 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:21:22,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:21:22,246 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:21:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:21:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2097637963, now seen corresponding path program 1 times [2022-04-15 01:21:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:21:22,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772455714] [2022-04-15 01:21:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:21:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:21:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:22,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {148#true} is VALID [2022-04-15 01:21:22,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-15 01:21:22,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-15 01:21:22,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:21:22,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {148#true} is VALID [2022-04-15 01:21:22,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-15 01:21:22,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-15 01:21:22,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {148#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-15 01:21:22,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:22,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:22,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:22,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {154#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:21:22,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(not (= |__VERIFIER_assert_#in~cond| 0))} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {155#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:21:22,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(not (= __VERIFIER_assert_~cond 0))} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {149#false} is VALID [2022-04-15 01:21:22,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#false} is VALID [2022-04-15 01:21:22,638 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-15 01:21:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:21:22,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772455714] [2022-04-15 01:21:22,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772455714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:21:22,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:21:22,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 01:21:22,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769292962] [2022-04-15 01:21:22,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:21:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:21:22,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:21:22,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:22,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:22,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:21:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:21:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:21:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:21:22,657 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:24,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:31,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:37,837 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-15 01:21:40,000 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-15 01:21:42,160 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-15 01:21:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:42,340 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 01:21:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:21:42,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:21:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:21:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 01:21:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 01:21:42,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 01:21:42,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:42,383 INFO L225 Difference]: With dead ends: 26 [2022-04-15 01:21:42,383 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 01:21:42,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:21:42,384 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-15 01:21:42,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-15 01:21:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 01:21:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 01:21:42,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:21:42,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,388 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,388 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:42,390 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-15 01:21:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 01:21:42,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:42,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:42,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 01:21:42,391 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 01:21:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:42,394 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-15 01:21:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 01:21:42,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:42,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:42,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:21:42,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:21:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-15 01:21:42,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-15 01:21:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:21:42,399 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-15 01:21:42,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 01:21:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 01:21:42,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:21:42,400 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:21:42,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:21:42,402 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:21:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:21:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1607843865, now seen corresponding path program 1 times [2022-04-15 01:21:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:21:42,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739437628] [2022-04-15 01:21:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:42,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:21:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:21:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:43,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {271#true} is VALID [2022-04-15 01:21:43,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:21:43,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {271#true} is VALID [2022-04-15 01:21:43,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,038 INFO L272 TraceCheckUtils]: 11: Hoare triple {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:21:43,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(not (= |__VERIFIER_assert_#in~cond| 0))} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:21:43,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#(not (= __VERIFIER_assert_~cond 0))} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-15 01:21:43,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-15 01:21:43,043 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-15 01:21:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:21:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739437628] [2022-04-15 01:21:43,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739437628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:21:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809043618] [2022-04-15 01:21:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:43,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:21:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:21:43,045 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-15 01:21:43,091 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-15 01:21:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:43,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 01:21:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:43,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:21:43,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {271#true} is VALID [2022-04-15 01:21:43,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:43,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:43,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:21:43,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:21:43,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-15 01:21:43,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-15 01:21:43,541 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-15 01:21:43,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:21:43,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-15 01:21:43,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-15 01:21:43,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:21:43,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:21:43,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:21:43,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:21:46,034 WARN L290 TraceCheckUtils]: 8: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:21:46,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:21:46,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:21:46,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:21:46,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:46,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:46,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:46,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {271#true} is VALID [2022-04-15 01:21:46,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-15 01:21:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:21:46,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809043618] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:21:46,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:21:46,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-15 01:21:46,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777197011] [2022-04-15 01:21:46,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:21:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 01:21:46,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:21:46,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:48,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:48,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:21:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:21:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:21:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 01:21:48,172 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:50,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:52,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:00,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:03,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:11,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:16,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:16,316 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 01:22:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:22:16,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 01:22:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:22:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 01:22:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 01:22:16,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 01:22:18,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:18,472 INFO L225 Difference]: With dead ends: 28 [2022-04-15 01:22:18,472 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 01:22:18,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-15 01:22:18,474 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-15 01:22:18,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 6 Unknown, 0 Unchecked, 12.7s Time] [2022-04-15 01:22:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 01:22:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 01:22:18,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:22:18,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,482 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,482 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:18,483 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 01:22:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 01:22:18,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:18,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:18,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 01:22:18,484 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 01:22:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:18,486 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 01:22:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 01:22:18,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:18,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:18,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:22:18,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:22:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-15 01:22:18,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-15 01:22:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:22:18,489 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-15 01:22:18,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 01:22:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 01:22:18,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:22:18,490 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:22:18,513 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-15 01:22:18,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:18,704 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:22:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:22:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1132300265, now seen corresponding path program 1 times [2022-04-15 01:22:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:22:18,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184932556] [2022-04-15 01:22:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:22:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:22:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:19,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:19,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:19,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:19,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {496#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:22:19,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:19,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:19,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:19,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:19,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:19,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {503#(= main_~l~0 0)} is VALID [2022-04-15 01:22:19,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {503#(= main_~l~0 0)} is VALID [2022-04-15 01:22:19,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(= main_~l~0 0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-15 01:22:19,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#false} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {497#false} is VALID [2022-04-15 01:22:19,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {497#false} is VALID [2022-04-15 01:22:19,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-15 01:22:19,033 INFO L272 TraceCheckUtils]: 12: Hoare triple {497#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {497#false} is VALID [2022-04-15 01:22:19,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {497#false} is VALID [2022-04-15 01:22:19,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-15 01:22:19,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {497#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-15 01:22:19,034 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-15 01:22:19,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:22:19,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184932556] [2022-04-15 01:22:19,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184932556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:22:19,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:22:19,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 01:22:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089863877] [2022-04-15 01:22:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:22:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 01:22:19,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:22:19,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:21,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:21,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 01:22:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:22:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 01:22:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:22:21,236 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:25,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:34,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:34,397 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-15 01:22:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:22:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 01:22:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:22:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 01:22:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 01:22:34,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 01:22:36,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:36,620 INFO L225 Difference]: With dead ends: 37 [2022-04-15 01:22:36,621 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 01:22:36,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:22:36,622 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:22:36,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 01:22:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 01:22:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 01:22:36,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:22:36,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:36,638 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:36,638 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:36,640 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 01:22:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 01:22:36,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:36,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:36,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 01:22:36,641 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 01:22:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:36,643 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 01:22:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 01:22:36,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:36,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:36,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:22:36,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:22:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-15 01:22:36,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-15 01:22:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:22:36,645 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-15 01:22:36,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 01:22:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 01:22:36,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:22:36,646 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:22:36,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 01:22:36,646 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:22:36,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:22:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash -932165961, now seen corresponding path program 1 times [2022-04-15 01:22:36,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:22:36,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217230374] [2022-04-15 01:22:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:36,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:22:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:22:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:36,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:36,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:36,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:36,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:22:36,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:36,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:36,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:36,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:36,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:36,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {651#(= main_~l~0 0)} is VALID [2022-04-15 01:22:36,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {651#(= main_~l~0 0)} is VALID [2022-04-15 01:22:36,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {651#(= main_~l~0 0)} is VALID [2022-04-15 01:22:36,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-15 01:22:36,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-15 01:22:36,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-15 01:22:36,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {645#false} is VALID [2022-04-15 01:22:36,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {645#false} is VALID [2022-04-15 01:22:36,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:36,988 INFO L272 TraceCheckUtils]: 15: Hoare triple {645#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {645#false} is VALID [2022-04-15 01:22:36,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {645#false} is VALID [2022-04-15 01:22:36,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {645#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:36,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:22:36,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:22:36,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217230374] [2022-04-15 01:22:36,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217230374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:22:36,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993774138] [2022-04-15 01:22:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:22:36,991 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-15 01:22:37,014 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-15 01:22:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:37,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 01:22:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:37,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:22:37,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:37,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {644#true} is VALID [2022-04-15 01:22:37,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:37,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:37,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:37,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:37,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:37,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-15 01:22:37,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-15 01:22:37,549 INFO L272 TraceCheckUtils]: 15: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:22:37,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:22:37,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:37,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:22:37,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:22:37,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:37,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-15 01:22:37,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:22:37,831 INFO L272 TraceCheckUtils]: 15: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:22:37,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:37,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:39,940 WARN L290 TraceCheckUtils]: 12: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:22:39,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:39,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:39,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:42,076 WARN L290 TraceCheckUtils]: 8: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:22:42,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:42,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:42,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:22:42,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:42,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:42,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:42,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {644#true} is VALID [2022-04-15 01:22:42,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-15 01:22:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:22:42,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993774138] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:22:42,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:22:42,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-15 01:22:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848049466] [2022-04-15 01:22:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:22:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 01:22:42,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:22:42,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:46,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:46,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:22:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:22:46,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:22:46,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-15 01:22:46,330 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:48,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:50,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:52,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:54,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:59,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:05,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:09,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:23:10,091 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 01:23:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:23:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 01:23:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:23:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 01:23:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 01:23:10,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 01:23:14,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:23:14,350 INFO L225 Difference]: With dead ends: 33 [2022-04-15 01:23:14,350 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 01:23:14,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 01:23:14,351 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:23:14,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 7 Unknown, 0 Unchecked, 14.3s Time] [2022-04-15 01:23:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 01:23:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-15 01:23:14,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:23:14,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:14,363 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:14,364 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:23:14,366 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 01:23:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 01:23:14,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:23:14,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:23:14,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 01:23:14,367 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 01:23:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:23:14,368 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 01:23:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 01:23:14,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:23:14,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:23:14,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:23:14,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:23:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 01:23:14,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-15 01:23:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:23:14,370 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 01:23:14,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 01:23:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 01:23:14,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:23:14,371 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:23:14,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 01:23:14,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:23:14,588 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:23:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:23:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1043545585, now seen corresponding path program 1 times [2022-04-15 01:23:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:23:14,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954669160] [2022-04-15 01:23:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:23:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:23:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:14,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:23:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:14,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {914#true} is VALID [2022-04-15 01:23:14,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:14,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:14,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:23:14,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {914#true} is VALID [2022-04-15 01:23:14,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:14,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:14,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:14,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {919#(= main_~l~0 0)} is VALID [2022-04-15 01:23:14,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {919#(= main_~l~0 0)} is VALID [2022-04-15 01:23:14,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {919#(= main_~l~0 0)} is VALID [2022-04-15 01:23:14,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {919#(= main_~l~0 0)} is VALID [2022-04-15 01:23:14,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:23:14,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:23:14,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:23:14,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:23:14,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {915#false} is VALID [2022-04-15 01:23:14,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {915#false} is VALID [2022-04-15 01:23:14,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:14,687 INFO L272 TraceCheckUtils]: 16: Hoare triple {915#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {915#false} is VALID [2022-04-15 01:23:14,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {915#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {915#false} is VALID [2022-04-15 01:23:14,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:14,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:23:14,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:23:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954669160] [2022-04-15 01:23:14,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954669160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:23:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222669074] [2022-04-15 01:23:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:23:14,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:23:14,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:23:14,691 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-15 01:23:14,696 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-15 01:23:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:14,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 01:23:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:23:15,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:15,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {914#true} is VALID [2022-04-15 01:23:15,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:15,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:15,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:15,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:15,225 INFO L272 TraceCheckUtils]: 16: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:23:15,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:23:15,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:15,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:23:15,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:23:15,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:15,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 01:23:15,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:23:15,490 INFO L272 TraceCheckUtils]: 16: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:23:15,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:15,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:15,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-15 01:23:15,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:15,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:15,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:15,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:17,617 WARN L290 TraceCheckUtils]: 8: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:23:17,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:17,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:17,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:17,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:17,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:17,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:17,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {914#true} is VALID [2022-04-15 01:23:17,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-15 01:23:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:23:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222669074] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:23:17,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:23:17,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-15 01:23:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788632808] [2022-04-15 01:23:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:23:17,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 01:23:17,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:23:17,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:19,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:23:19,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:23:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:23:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:23:19,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 01:23:19,748 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:21,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:23,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:26,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:28,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:30,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:32,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:34,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:36,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:23:36,969 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-15 01:23:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:23:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 01:23:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:23:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:23:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:23:36,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-15 01:23:39,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:23:39,171 INFO L225 Difference]: With dead ends: 40 [2022-04-15 01:23:39,172 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 01:23:39,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:23:39,173 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:23:39,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 17.0s Time] [2022-04-15 01:23:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 01:23:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 01:23:39,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:23:39,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:39,188 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:39,188 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:23:39,190 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-15 01:23:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-15 01:23:39,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:23:39,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:23:39,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 01:23:39,191 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 01:23:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:23:39,192 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-15 01:23:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-15 01:23:39,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:23:39,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:23:39,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:23:39,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:23:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-15 01:23:39,194 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-15 01:23:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:23:39,194 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-15 01:23:39,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-15 01:23:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 01:23:39,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:23:39,195 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:23:39,217 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-15 01:23:39,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:23:39,396 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:23:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:23:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -58795524, now seen corresponding path program 1 times [2022-04-15 01:23:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:23:39,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644750287] [2022-04-15 01:23:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:23:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:23:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:23:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:39,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:23:39,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:23:39,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:23:39,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:23:39,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:23:39,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:23:39,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:23:39,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:23:39,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:23:39,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1227#(= main_~l~0 0)} is VALID [2022-04-15 01:23:39,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1227#(= main_~l~0 0)} is VALID [2022-04-15 01:23:39,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1227#(= main_~l~0 0)} is VALID [2022-04-15 01:23:39,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:23:39,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:23:39,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:23:39,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:23:39,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:23:39,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:23:39,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-15 01:23:39,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:39,827 INFO L272 TraceCheckUtils]: 17: Hoare triple {1221#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1221#false} is VALID [2022-04-15 01:23:39,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {1221#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1221#false} is VALID [2022-04-15 01:23:39,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {1221#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:39,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:23:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:23:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644750287] [2022-04-15 01:23:39,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644750287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:23:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571032006] [2022-04-15 01:23:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:23:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:23:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:23:39,829 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-15 01:23:39,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 01:23:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:39,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 01:23:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:23:39,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:23:40,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:40,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1220#true} is VALID [2022-04-15 01:23:40,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:40,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:40,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:40,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:23:40,490 INFO L272 TraceCheckUtils]: 17: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:23:40,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:23:40,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:40,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:23:40,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:23:40,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:40,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-15 01:23:40,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:23:40,862 INFO L272 TraceCheckUtils]: 17: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:23:40,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:40,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:42,976 WARN L290 TraceCheckUtils]: 14: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:23:42,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:42,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:42,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:42,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:42,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:45,089 WARN L290 TraceCheckUtils]: 8: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:23:45,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:45,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:45,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:23:45,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:45,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:45,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:45,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1220#true} is VALID [2022-04-15 01:23:45,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-15 01:23:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:23:45,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571032006] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:23:45,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:23:45,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-15 01:23:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798008471] [2022-04-15 01:23:45,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:23:45,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 01:23:45,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:23:45,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:49,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:23:49,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:23:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:23:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:23:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-15 01:23:49,325 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:23:51,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:53,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:55,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:57,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:23:59,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:02,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:02,391 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-15 01:24:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:24:02,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 01:24:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:24:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:24:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:24:02,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-15 01:24:06,674 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-15 01:24:06,675 INFO L225 Difference]: With dead ends: 45 [2022-04-15 01:24:06,675 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 01:24:06,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 01:24:06,676 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-04-15 01:24:06,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 6 Unknown, 0 Unchecked, 12.9s Time] [2022-04-15 01:24:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 01:24:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-15 01:24:06,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:24:06,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:06,690 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:06,690 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:06,691 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-15 01:24:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-15 01:24:06,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:24:06,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:24:06,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 01:24:06,692 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 01:24:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:06,693 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-15 01:24:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-15 01:24:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:24:06,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:24:06,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:24:06,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:24:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-15 01:24:06,696 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-15 01:24:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:24:06,696 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-15 01:24:06,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-15 01:24:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 01:24:06,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:24:06,697 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:24:06,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 01:24:06,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:24:06,898 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:24:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:24:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2116274639, now seen corresponding path program 1 times [2022-04-15 01:24:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:24:06,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310260443] [2022-04-15 01:24:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:24:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:24:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:24:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:06,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {1562#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1555#true} is VALID [2022-04-15 01:24:06,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:06,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:06,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:24:06,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1555#true} is VALID [2022-04-15 01:24:06,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:06,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:06,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:06,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1560#(= main_~l~0 0)} is VALID [2022-04-15 01:24:06,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1560#(= main_~l~0 0)} is VALID [2022-04-15 01:24:06,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1560#(= main_~l~0 0)} is VALID [2022-04-15 01:24:06,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1560#(= main_~l~0 0)} is VALID [2022-04-15 01:24:06,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:06,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:06,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:06,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:06,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:06,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:06,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1556#false} is VALID [2022-04-15 01:24:06,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {1556#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1556#false} is VALID [2022-04-15 01:24:06,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {1556#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:06,972 INFO L272 TraceCheckUtils]: 18: Hoare triple {1556#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1556#false} is VALID [2022-04-15 01:24:06,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {1556#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1556#false} is VALID [2022-04-15 01:24:06,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {1556#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:06,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:24:06,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:24:06,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310260443] [2022-04-15 01:24:06,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310260443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:24:06,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990177520] [2022-04-15 01:24:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:24:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:24:06,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:24:06,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:24:06,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 01:24:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:07,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 01:24:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:07,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:24:07,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:07,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1555#true} is VALID [2022-04-15 01:24:07,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:07,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:07,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:07,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1591#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1591#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1614#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1614#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:07,512 INFO L272 TraceCheckUtils]: 18: Hoare triple {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:24:07,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:24:07,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:07,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:24:07,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:24:07,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:07,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-15 01:24:07,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:24:07,794 INFO L272 TraceCheckUtils]: 18: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:24:07,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-15 01:24:07,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:07,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:09,919 WARN L290 TraceCheckUtils]: 8: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:24:09,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:09,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:09,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:09,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:09,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:09,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:09,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1555#true} is VALID [2022-04-15 01:24:09,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-15 01:24:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:24:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990177520] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:24:09,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:24:09,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-15 01:24:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518092140] [2022-04-15 01:24:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:24:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 01:24:09,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:24:09,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:12,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:24:12,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:24:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:24:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:24:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 01:24:12,055 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:14,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:16,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:18,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:20,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-15 01:24:22,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:24,908 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-15 01:24:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:25,193 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-15 01:24:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:24:25,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 01:24:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:24:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:24:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:24:25,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 01:24:27,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:24:27,393 INFO L225 Difference]: With dead ends: 53 [2022-04-15 01:24:27,393 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 01:24:27,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:24:27,394 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-04-15 01:24:27,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 6 Unknown, 0 Unchecked, 12.9s Time] [2022-04-15 01:24:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 01:24:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 01:24:27,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:24:27,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:27,413 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:27,413 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:27,415 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-15 01:24:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-15 01:24:27,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:24:27,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:24:27,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 01:24:27,416 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 01:24:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:27,417 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-15 01:24:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-15 01:24:27,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:24:27,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:24:27,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:24:27,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:24:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-15 01:24:27,420 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-15 01:24:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:24:27,420 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-15 01:24:27,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-15 01:24:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 01:24:27,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:24:27,421 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:24:27,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 01:24:27,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:24:27,640 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:24:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:24:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1618193969, now seen corresponding path program 1 times [2022-04-15 01:24:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:24:27,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039532260] [2022-04-15 01:24:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:24:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:24:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:24:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:27,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1930#true} is VALID [2022-04-15 01:24:27,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:27,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:27,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {1930#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:24:27,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1930#true} is VALID [2022-04-15 01:24:27,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:27,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:27,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:27,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {1930#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1935#(= main_~l~0 0)} is VALID [2022-04-15 01:24:27,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {1935#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1935#(= main_~l~0 0)} is VALID [2022-04-15 01:24:27,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {1935#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1935#(= main_~l~0 0)} is VALID [2022-04-15 01:24:27,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {1935#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1935#(= main_~l~0 0)} is VALID [2022-04-15 01:24:27,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:27,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:27,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:27,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:27,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-15 01:24:27,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-15 01:24:27,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-15 01:24:27,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-15 01:24:27,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1931#false} is VALID [2022-04-15 01:24:27,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {1931#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1931#false} is VALID [2022-04-15 01:24:27,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {1931#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:27,743 INFO L272 TraceCheckUtils]: 20: Hoare triple {1931#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1931#false} is VALID [2022-04-15 01:24:27,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {1931#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1931#false} is VALID [2022-04-15 01:24:27,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {1931#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:27,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:24:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:24:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039532260] [2022-04-15 01:24:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039532260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:24:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223723498] [2022-04-15 01:24:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:24:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:24:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:24:27,749 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:24:27,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 01:24:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:27,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 01:24:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:27,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:24:28,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {1930#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:28,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {1930#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1930#true} is VALID [2022-04-15 01:24:28,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:28,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:28,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:28,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1930#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:24:28,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1981#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {1981#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1998#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-15 01:24:28,462 INFO L272 TraceCheckUtils]: 20: Hoare triple {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:24:28,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:24:28,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {2013#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:28,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:24:28,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:24:28,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:28,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {2013#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-15 01:24:28,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:24:28,761 INFO L272 TraceCheckUtils]: 20: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:24:28,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:28,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:28,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-15 01:24:28,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:28,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:28,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:28,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:30,907 WARN L290 TraceCheckUtils]: 12: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:24:30,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:30,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:30,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:33,026 WARN L290 TraceCheckUtils]: 8: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:24:33,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:33,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:33,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {1930#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:24:33,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:33,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:33,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:33,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1930#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1930#true} is VALID [2022-04-15 01:24:33,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {1930#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-15 01:24:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 01:24:33,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223723498] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:24:33,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:24:33,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-15 01:24:33,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266274004] [2022-04-15 01:24:33,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:24:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 01:24:33,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:24:33,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:37,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:24:37,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:24:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:24:37,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:24:37,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 01:24:37,272 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:39,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:41,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:43,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:45,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:47,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:50,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:52,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:54,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:24:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:54,506 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-04-15 01:24:54,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:24:54,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 01:24:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:24:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:24:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:24:54,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-15 01:24:58,878 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-15 01:24:58,879 INFO L225 Difference]: With dead ends: 59 [2022-04-15 01:24:58,879 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 01:24:58,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-15 01:24:58,880 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-04-15 01:24:58,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 16.9s Time] [2022-04-15 01:24:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 01:24:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-15 01:24:58,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:24:58,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:58,895 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:58,896 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:58,897 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-15 01:24:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-15 01:24:58,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:24:58,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:24:58,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 01:24:58,898 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 01:24:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:24:58,899 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-15 01:24:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-15 01:24:58,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:24:58,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:24:58,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:24:58,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:24:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-15 01:24:58,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-15 01:24:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:24:58,902 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-15 01:24:58,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:24:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-15 01:24:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 01:24:58,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:24:58,903 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:24:58,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 01:24:59,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:24:59,108 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:24:59,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:24:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 850752026, now seen corresponding path program 1 times [2022-04-15 01:24:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:24:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025388595] [2022-04-15 01:24:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:24:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:24:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:24:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:59,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {2346#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:24:59,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:24:59,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:24:59,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {2335#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:24:59,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2346#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:24:59,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:24:59,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:24:59,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:24:59,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2341#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:24:59,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {2341#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2342#(= main_~l~0 0)} is VALID [2022-04-15 01:24:59,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2342#(= main_~l~0 0)} is VALID [2022-04-15 01:24:59,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2342#(= main_~l~0 0)} is VALID [2022-04-15 01:24:59,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {2342#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:59,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:59,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:59,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:24:59,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2344#(<= (+ 2 (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 3 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:24:59,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {2344#(<= (+ 2 (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 3 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296)) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:24:59,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:24:59,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:24:59,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:24:59,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2336#false} is VALID [2022-04-15 01:24:59,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {2336#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2336#false} is VALID [2022-04-15 01:24:59,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {2336#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:24:59,523 INFO L272 TraceCheckUtils]: 21: Hoare triple {2336#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2336#false} is VALID [2022-04-15 01:24:59,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {2336#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2336#false} is VALID [2022-04-15 01:24:59,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {2336#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:24:59,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:24:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:24:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:24:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025388595] [2022-04-15 01:24:59,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025388595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:24:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663562349] [2022-04-15 01:24:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:24:59,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:24:59,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:24:59,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:24:59,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 01:24:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:59,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 01:24:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:24:59,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:25:00,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {2335#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:00,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2335#true} is VALID [2022-04-15 01:25:00,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2335#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:00,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2335#true} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:00,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {2335#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:00,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {2335#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2376#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {2376#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:00,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2390#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {2390#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2410#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {2410#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:25:00,215 INFO L272 TraceCheckUtils]: 21: Hoare triple {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:25:00,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:25:00,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:25:00,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:25:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:25:00,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:25:00,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:25:00,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-15 01:25:00,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:25:00,577 INFO L272 TraceCheckUtils]: 21: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:25:00,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:00,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:02,694 WARN L290 TraceCheckUtils]: 18: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:25:02,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:02,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:02,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:02,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:02,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:04,805 WARN L290 TraceCheckUtils]: 12: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:25:04,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:04,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:04,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:06,910 WARN L290 TraceCheckUtils]: 8: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:25:06,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:06,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:06,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {2335#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:06,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {2335#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:06,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2335#true} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:06,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {2335#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:06,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2335#true} is VALID [2022-04-15 01:25:06,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {2335#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-15 01:25:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 01:25:06,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663562349] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:25:06,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:25:06,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-15 01:25:06,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903449705] [2022-04-15 01:25:06,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:25:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 01:25:06,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:25:06,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:13,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 01:25:13,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:25:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:25:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:25:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-15 01:25:13,273 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:15,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:17,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:19,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:21,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:24,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:25:24,265 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-15 01:25:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:25:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 01:25:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:25:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:25:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 01:25:24,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-15 01:25:30,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 36 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 01:25:30,701 INFO L225 Difference]: With dead ends: 56 [2022-04-15 01:25:30,701 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 01:25:30,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-15 01:25:30,702 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-15 01:25:30,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 10.5s Time] [2022-04-15 01:25:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 01:25:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-15 01:25:30,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:25:30,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:30,716 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:30,716 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:25:30,718 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-15 01:25:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-15 01:25:30,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:25:30,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:25:30,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 01:25:30,719 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 01:25:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:25:30,720 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-15 01:25:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-15 01:25:30,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:25:30,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:25:30,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:25:30,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:25:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-15 01:25:30,721 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-15 01:25:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:25:30,722 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-15 01:25:30,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-15 01:25:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 01:25:30,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:25:30,722 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:25:30,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 01:25:30,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:25:30,928 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:25:30,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:25:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash 309895635, now seen corresponding path program 1 times [2022-04-15 01:25:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:25:30,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51819585] [2022-04-15 01:25:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:25:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:25:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:25:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:31,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {2743#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:31,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:31,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:31,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {2734#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2743#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:25:31,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {2743#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:31,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:31,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:31,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:31,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2740#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:31,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {2740#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2741#(= main_~l~0 0)} is VALID [2022-04-15 01:25:31,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {2741#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2741#(= main_~l~0 0)} is VALID [2022-04-15 01:25:31,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {2741#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2741#(= main_~l~0 0)} is VALID [2022-04-15 01:25:31,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {2741#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-15 01:25:31,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-15 01:25:31,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {2735#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {2735#false} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {2735#false} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {2735#false} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {2735#false} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {2735#false} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {2735#false} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {2735#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {2735#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L272 TraceCheckUtils]: 22: Hoare triple {2735#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2735#false} is VALID [2022-04-15 01:25:31,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {2735#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2735#false} is VALID [2022-04-15 01:25:31,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {2735#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 01:25:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:25:31,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51819585] [2022-04-15 01:25:31,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51819585] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:25:31,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203142007] [2022-04-15 01:25:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:25:31,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:25:31,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:25:31,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:25:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 01:25:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:31,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 01:25:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:31,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:25:31,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {2734#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:31,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2734#true} is VALID [2022-04-15 01:25:31,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:31,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2734#true} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:31,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {2734#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:31,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {2734#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2773#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:31,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2787#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {2787#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2810#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:25:31,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2810#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-15 01:25:31,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-15 01:25:31,816 INFO L272 TraceCheckUtils]: 22: Hoare triple {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:25:31,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:25:31,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {2825#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:25:31,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:25:32,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:32,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {2825#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-15 01:25:32,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:25:32,075 INFO L272 TraceCheckUtils]: 22: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:25:32,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-15 01:25:32,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:32,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:34,202 WARN L290 TraceCheckUtils]: 12: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:25:34,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:34,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:34,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:36,317 WARN L290 TraceCheckUtils]: 8: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:25:36,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:36,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:36,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {2734#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:36,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {2734#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:36,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2734#true} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:36,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:36,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2734#true} is VALID [2022-04-15 01:25:36,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {2734#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-15 01:25:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 01:25:36,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203142007] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:25:36,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:25:36,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 19 [2022-04-15 01:25:36,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128545069] [2022-04-15 01:25:36,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:25:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 01:25:36,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:25:36,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:40,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:25:40,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:25:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:25:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:25:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-15 01:25:40,574 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:42,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:44,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:47,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:49,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:51,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:25:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:25:51,543 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2022-04-15 01:25:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:25:51,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 01:25:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:25:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:25:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:25:51,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 01:25:55,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:25:55,882 INFO L225 Difference]: With dead ends: 58 [2022-04-15 01:25:55,882 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 01:25:55,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-15 01:25:55,883 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-15 01:25:55,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 10.7s Time] [2022-04-15 01:25:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 01:25:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-15 01:25:55,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:25:55,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:55,897 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:55,897 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:25:55,898 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-15 01:25:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-15 01:25:55,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:25:55,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:25:55,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 01:25:55,899 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 01:25:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:25:55,900 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-15 01:25:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-15 01:25:55,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:25:55,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:25:55,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:25:55,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:25:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-15 01:25:55,901 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-15 01:25:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:25:55,902 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-15 01:25:55,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:25:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-15 01:25:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 01:25:55,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:25:55,902 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:25:55,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 01:25:56,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 01:25:56,112 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:25:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:25:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash 522176238, now seen corresponding path program 1 times [2022-04-15 01:25:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:25:56,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590738699] [2022-04-15 01:25:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:25:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:25:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:25:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:56,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {3156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:56,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:56,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:56,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {3143#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:25:56,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {3156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:56,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:25:56,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:56,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:56,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3149#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:25:56,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {3149#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3150#(= main_~l~0 0)} is VALID [2022-04-15 01:25:56,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {3150#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3150#(= main_~l~0 0)} is VALID [2022-04-15 01:25:56,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {3150#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3150#(= main_~l~0 0)} is VALID [2022-04-15 01:25:56,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {3150#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3151#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:25:56,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {3151#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:25:56,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:25:56,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:25:56,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:25:56,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3153#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:25:56,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {3153#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:25:56,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3155#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-15 01:25:56,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {3155#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:56,444 INFO L272 TraceCheckUtils]: 24: Hoare triple {3144#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3144#false} is VALID [2022-04-15 01:25:56,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {3144#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3144#false} is VALID [2022-04-15 01:25:56,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {3144#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:56,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:25:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:25:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590738699] [2022-04-15 01:25:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590738699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:25:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965204141] [2022-04-15 01:25:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:25:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:25:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:25:56,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:25:56,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 01:25:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:56,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 01:25:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:25:56,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:25:57,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {3143#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:25:57,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {3143#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3143#true} is VALID [2022-04-15 01:25:57,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {3143#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:25:57,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3143#true} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:25:57,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {3143#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:25:57,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {3143#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3186#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {3186#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3206#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {3206#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3229#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {3229#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-15 01:25:57,239 INFO L272 TraceCheckUtils]: 24: Hoare triple {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:25:57,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:25:57,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {3244#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:57,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:25:57,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:25:57,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:57,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {3244#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-15 01:25:57,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:25:57,596 INFO L272 TraceCheckUtils]: 24: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:25:57,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-15 01:25:57,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:57,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:59,720 WARN L290 TraceCheckUtils]: 14: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:25:59,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:59,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:59,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:59,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:25:59,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:01,829 WARN L290 TraceCheckUtils]: 8: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:26:01,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:01,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:01,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {3143#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:01,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {3143#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:26:01,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3143#true} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:26:01,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {3143#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:26:01,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {3143#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3143#true} is VALID [2022-04-15 01:26:01,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {3143#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-15 01:26:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 01:26:01,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965204141] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:26:01,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:26:01,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-15 01:26:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975782585] [2022-04-15 01:26:01,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:26:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 01:26:01,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:26:01,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:06,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:26:06,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:26:06,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:26:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:26:06,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-15 01:26:06,093 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:08,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:10,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:12,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:14,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:16,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:18,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:20,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:23,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:25,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:27,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:29,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:26:29,841 INFO L93 Difference]: Finished difference Result 71 states and 107 transitions. [2022-04-15 01:26:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:26:29,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 01:26:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:26:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:26:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:26:29,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 01:26:34,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:26:34,206 INFO L225 Difference]: With dead ends: 71 [2022-04-15 01:26:34,206 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 01:26:34,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-15 01:26:34,207 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:26:34,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 23.3s Time] [2022-04-15 01:26:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 01:26:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 01:26:34,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:26:34,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:34,227 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:34,227 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:26:34,228 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-15 01:26:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-15 01:26:34,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:26:34,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:26:34,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 01:26:34,229 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 01:26:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:26:34,230 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-15 01:26:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-15 01:26:34,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:26:34,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:26:34,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:26:34,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:26:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-15 01:26:34,232 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-15 01:26:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:26:34,233 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-15 01:26:34,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-15 01:26:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 01:26:34,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:26:34,233 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:26:34,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 01:26:34,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:26:34,457 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:26:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:26:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2133946640, now seen corresponding path program 1 times [2022-04-15 01:26:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:26:34,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580830005] [2022-04-15 01:26:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:26:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:26:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:26:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:26:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:26:34,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {3648#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3639#true} is VALID [2022-04-15 01:26:34,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:34,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:34,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {3639#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3648#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:26:34,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {3648#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3639#true} is VALID [2022-04-15 01:26:34,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:34,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:34,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:34,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3644#(= main_~l~0 0)} is VALID [2022-04-15 01:26:34,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {3644#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3644#(= main_~l~0 0)} is VALID [2022-04-15 01:26:34,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {3644#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3644#(= main_~l~0 0)} is VALID [2022-04-15 01:26:34,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {3644#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3644#(= main_~l~0 0)} is VALID [2022-04-15 01:26:34,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {3644#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:26:34,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:26:34,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:26:34,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:26:34,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-15 01:26:34,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-15 01:26:34,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-15 01:26:34,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-15 01:26:34,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-15 01:26:34,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-15 01:26:34,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-15 01:26:34,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-15 01:26:34,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-15 01:26:34,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-15 01:26:34,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-15 01:26:34,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-15 01:26:34,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3640#false} is VALID [2022-04-15 01:26:34,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3640#false} is VALID [2022-04-15 01:26:34,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {3640#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:34,578 INFO L272 TraceCheckUtils]: 28: Hoare triple {3640#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3640#false} is VALID [2022-04-15 01:26:34,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {3640#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3640#false} is VALID [2022-04-15 01:26:34,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {3640#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:34,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {3640#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:26:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:26:34,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580830005] [2022-04-15 01:26:34,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580830005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:26:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146183909] [2022-04-15 01:26:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:26:34,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:26:34,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:26:34,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:26:34,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 01:26:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:26:34,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 01:26:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:26:34,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:26:35,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {3639#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:35,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {3639#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3639#true} is VALID [2022-04-15 01:26:35,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:35,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:35,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:35,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3677#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {3677#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:26:35,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3691#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {3691#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3711#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {3711#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3734#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {3734#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:26:35,454 INFO L272 TraceCheckUtils]: 28: Hoare triple {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:26:35,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:26:35,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {3749#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:35,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {3640#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:26:35,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:26:35,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {3640#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:35,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {3749#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-15 01:26:35,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:26:35,774 INFO L272 TraceCheckUtils]: 28: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:26:35,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-15 01:26:35,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:35,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:37,915 WARN L290 TraceCheckUtils]: 18: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:26:37,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:37,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:37,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:37,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:37,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:40,038 WARN L290 TraceCheckUtils]: 12: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:26:40,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:40,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:40,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:42,160 WARN L290 TraceCheckUtils]: 8: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-15 01:26:42,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:42,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:42,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-15 01:26:42,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:42,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:42,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:42,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {3639#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3639#true} is VALID [2022-04-15 01:26:42,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {3639#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-15 01:26:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 01:26:42,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146183909] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:26:42,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:26:42,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 13] total 20 [2022-04-15 01:26:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648839537] [2022-04-15 01:26:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:26:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 01:26:42,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:26:42,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:48,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 01:26:48,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:26:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:26:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:26:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-15 01:26:48,580 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:50,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:52,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:55,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:57,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:26:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:26:57,448 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-15 01:26:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:26:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 01:26:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:26:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 01:26:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:26:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 01:26:57,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-15 01:27:03,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 21 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 01:27:03,907 INFO L225 Difference]: With dead ends: 66 [2022-04-15 01:27:03,907 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:27:03,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-04-15 01:27:03,908 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-15 01:27:03,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 8.4s Time] [2022-04-15 01:27:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:27:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:27:03,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:27:03,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:27:03,909 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:27:03,909 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:27:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:03,909 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:27:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:27:03,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:03,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:03,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:27:03,909 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:27:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:03,910 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:27:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:27:03,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:03,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:03,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:27:03,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:27:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:27:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:27:03,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-15 01:27:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:27:03,910 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:27:03,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:27:03,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:03,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:27:03,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 01:27:04,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 01:27:04,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:27:04,273 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 01:27:04,273 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:27:04,273 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:27:04,273 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:27:04,273 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-15 01:27:04,273 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:27:04,273 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 39) the Hoare annotation is: true [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 39) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 39) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 34) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L31-2(lines 23 34) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 34) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 34) no Hoare annotation was computed. [2022-04-15 01:27:04,274 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-15 01:27:04,275 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-15 01:27:04,275 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-15 01:27:04,275 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-15 01:27:04,275 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-15 01:27:04,275 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-15 01:27:04,277 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:27:04,278 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:27:04,282 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:27:04,284 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 01:27:04,285 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 01:27:04,285 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:27:04,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:27:04 BasicIcfg [2022-04-15 01:27:04,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:27:04,296 INFO L158 Benchmark]: Toolchain (without parser) took 356374.45ms. Allocated memory was 185.6MB in the beginning and 262.1MB in the end (delta: 76.5MB). Free memory was 127.8MB in the beginning and 157.9MB in the end (delta: -30.1MB). Peak memory consumption was 46.9MB. Max. memory is 8.0GB. [2022-04-15 01:27:04,296 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:27:04,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.65ms. Allocated memory was 185.6MB in the beginning and 262.1MB in the end (delta: 76.5MB). Free memory was 127.5MB in the beginning and 232.4MB in the end (delta: -104.8MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-15 01:27:04,296 INFO L158 Benchmark]: Boogie Preprocessor took 25.64ms. Allocated memory is still 262.1MB. Free memory was 232.4MB in the beginning and 230.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:27:04,296 INFO L158 Benchmark]: RCFGBuilder took 6829.80ms. Allocated memory is still 262.1MB. Free memory was 230.8MB in the beginning and 217.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 01:27:04,297 INFO L158 Benchmark]: IcfgTransformer took 28.71ms. Allocated memory is still 262.1MB. Free memory was 217.7MB in the beginning and 216.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:27:04,297 INFO L158 Benchmark]: TraceAbstraction took 349163.31ms. Allocated memory is still 262.1MB. Free memory was 215.6MB in the beginning and 157.9MB in the end (delta: 57.7MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2022-04-15 01:27:04,298 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.65ms. Allocated memory was 185.6MB in the beginning and 262.1MB in the end (delta: 76.5MB). Free memory was 127.5MB in the beginning and 232.4MB in the end (delta: -104.8MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.64ms. Allocated memory is still 262.1MB. Free memory was 232.4MB in the beginning and 230.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6829.80ms. Allocated memory is still 262.1MB. Free memory was 230.8MB in the beginning and 217.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 28.71ms. Allocated memory is still 262.1MB. Free memory was 217.7MB in the beginning and 216.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 349163.31ms. Allocated memory is still 262.1MB. Free memory was 215.6MB in the beginning and 157.9MB in the end (delta: 57.7MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 349.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 250.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 73 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 154.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 147.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 586 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 187 mSDtfsCounter, 586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 364 SyntacticMatches, 36 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 26 NumberOfFragments, 64 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 660 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 52.9s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 8294 SizeOfPredicates, 10 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 140/307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((i + k + j + v3 + v2 + v4) % 4294967296 == l % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2022-04-15 01:27:04,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...