/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-34549b5 [2022-04-07 23:18:52,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:18:52,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:18:52,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:18:52,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:18:52,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:18:52,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:18:52,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:18:52,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:18:52,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:18:52,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:18:52,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:18:52,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:18:52,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:18:52,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:18:52,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:18:52,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:18:52,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:18:52,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:18:52,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:18:52,155 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:18:52,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:18:52,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:18:52,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:18:52,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:18:52,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:18:52,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:18:52,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:18:52,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:18:52,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:18:52,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:18:52,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:18:52,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:18:52,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:18:52,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:18:52,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:18:52,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:18:52,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:18:52,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:18:52,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:18:52,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:18:52,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:18:52,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:18:52,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:18:52,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:18:52,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:18:52,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:18:52,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:18:52,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:18:52,218 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:18:52,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:18:52,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:18:52,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:18:52,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:18:52,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:18:52,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:18:52,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:18:52,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:18:52,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:18:52,223 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:18:52,223 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-07 23:18:52,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:18:52,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:18:52,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:18:52,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:18:52,451 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:18:52,452 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-07 23:18:52,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a403e40d/a30649a525a14872acc2b6852284b34b/FLAGa5e2084c1 [2022-04-07 23:18:52,902 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:18:52,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-07 23:18:52,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a403e40d/a30649a525a14872acc2b6852284b34b/FLAGa5e2084c1 [2022-04-07 23:18:52,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a403e40d/a30649a525a14872acc2b6852284b34b [2022-04-07 23:18:52,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:18:52,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:18:52,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:18:52,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:18:52,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:18:52,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:18:52" (1/1) ... [2022-04-07 23:18:52,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57880c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:52, skipping insertion in model container [2022-04-07 23:18:52,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:18:52" (1/1) ... [2022-04-07 23:18:52,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:18:52,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:18:53,151 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-07 23:18:53,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:18:53,181 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:18:53,192 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-07 23:18:53,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:18:53,211 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:18:53,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53 WrapperNode [2022-04-07 23:18:53,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:18:53,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:18:53,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:18:53,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:18:53,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:18:53,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:18:53,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:18:53,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:18:53,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (1/1) ... [2022-04-07 23:18:53,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:18:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:18:53,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 23:18:53,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 23:18:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:18:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:18:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:18:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:18:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:18:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:18:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:18:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:18:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:18:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:18:53,370 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:18:53,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:19:00,044 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:19:00,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:19:00,050 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:19:00,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:19:00 BoogieIcfgContainer [2022-04-07 23:19:00,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:19:00,053 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:19:00,053 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:19:00,056 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:19:00,060 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:19:00" (1/1) ... [2022-04-07 23:19:00,062 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:19:00,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:19:00 BasicIcfg [2022-04-07 23:19:00,082 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:19:00,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:19:00,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:19:00,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:19:00,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:18:52" (1/4) ... [2022-04-07 23:19:00,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2758ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:19:00, skipping insertion in model container [2022-04-07 23:19:00,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:53" (2/4) ... [2022-04-07 23:19:00,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2758ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:19:00, skipping insertion in model container [2022-04-07 23:19:00,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:19:00" (3/4) ... [2022-04-07 23:19:00,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2758ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:19:00, skipping insertion in model container [2022-04-07 23:19:00,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:19:00" (4/4) ... [2022-04-07 23:19:00,089 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.cqvasr [2022-04-07 23:19:00,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:19:00,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:19:00,130 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:19:00,135 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-07 23:19:00,136 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:19:00,152 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-07 23:19:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:19:00,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:19:00,156 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:19:00,157 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:19:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:19:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2096714442, now seen corresponding path program 1 times [2022-04-07 23:19:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:19:00,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139877967] [2022-04-07 23:19:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:19:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:19:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:19:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:00,375 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-07 23:19:00,375 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-07 23:19:00,375 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-07 23:19:00,379 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-07 23:19:00,383 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-07 23:19:00,383 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-07 23:19:00,383 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-07 23:19:00,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 23:19:00,384 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-07 23:19:00,384 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-07 23:19:00,386 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-07 23:19:00,387 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-07 23:19:00,387 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-07 23:19:00,388 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-07 23:19:00,389 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-07 23:19:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:19:00,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:19:00,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139877967] [2022-04-07 23:19:00,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139877967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:19:00,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:19:00,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:19:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705250044] [2022-04-07 23:19:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:19:00,398 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-07 23:19:00,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:19:00,408 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-07 23:19:00,434 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-07 23:19:00,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:19:00,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:19:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:19:00,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:19:00,464 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-07 23:19:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:07,103 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 23:19:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:19:07,103 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-07 23:19:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:19:07,105 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-07 23:19:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-07 23:19:07,111 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-07 23:19:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-07 23:19:07,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-07 23:19:07,175 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-07 23:19:07,187 INFO L225 Difference]: With dead ends: 38 [2022-04-07 23:19:07,187 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 23:19:07,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:19:07,195 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-07 23:19:07,196 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-07 23:19:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 23:19:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 23:19:07,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:19:07,220 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-07 23:19:07,221 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-07 23:19:07,221 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-07 23:19:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:07,224 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-07 23:19:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 23:19:07,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:19:07,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:19:07,225 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-07 23:19:07,225 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-07 23:19:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:07,227 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-07 23:19:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 23:19:07,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:19:07,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:19:07,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:19:07,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:19:07,230 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-07 23:19:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-07 23:19:07,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-07 23:19:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:19:07,234 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-07 23:19:07,234 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-07 23:19:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 23:19:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:19:07,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:19:07,235 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:19:07,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:19:07,235 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:19:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:19:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2097637963, now seen corresponding path program 1 times [2022-04-07 23:19:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:19:07,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690602261] [2022-04-07 23:19:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:19:07,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:19:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:19:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:07,571 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-07 23:19:07,571 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-07 23:19:07,571 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-07 23:19:07,572 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-07 23:19:07,572 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-07 23:19:07,573 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-07 23:19:07,573 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-07 23:19:07,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {148#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-07 23:19:07,574 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-07 23:19:07,575 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-07 23:19:07,575 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-07 23:19:07,577 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-07 23:19:07,577 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-07 23:19:07,578 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-07 23:19:07,578 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-07 23:19:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:19:07,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:19:07,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690602261] [2022-04-07 23:19:07,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690602261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:19:07,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:19:07,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 23:19:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943316986] [2022-04-07 23:19:07,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:19:07,581 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-07 23:19:07,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:19:07,581 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-07 23:19:07,594 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-07 23:19:07,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:19:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:19:07,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:19:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:19:07,596 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-07 23:19:09,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:16,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:22,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:25,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:27,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:27,453 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 23:19:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:19:27,454 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-07 23:19:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:19:27,454 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-07 23:19:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-07 23:19:27,457 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-07 23:19:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-07 23:19:27,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-07 23:19:27,503 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-07 23:19:27,505 INFO L225 Difference]: With dead ends: 26 [2022-04-07 23:19:27,505 INFO L226 Difference]: Without dead ends: 21 [2022-04-07 23:19:27,505 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-07 23:19:27,506 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s 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.7s IncrementalHoareTripleChecker+Time [2022-04-07 23:19:27,507 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.7s Time] [2022-04-07 23:19:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-07 23:19:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-07 23:19:27,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:19:27,511 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-07 23:19:27,512 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-07 23:19:27,512 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-07 23:19:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:27,514 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-07 23:19:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 23:19:27,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:19:27,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:19:27,515 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-07 23:19:27,515 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-07 23:19:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:27,517 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-07 23:19:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 23:19:27,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:19:27,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:19:27,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:19:27,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:19:27,518 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-07 23:19:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-07 23:19:27,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-07 23:19:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:19:27,520 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-07 23:19:27,520 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-07 23:19:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 23:19:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 23:19:27,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:19:27,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:19:27,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:19:27,521 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:19:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:19:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1607843865, now seen corresponding path program 1 times [2022-04-07 23:19:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:19:27,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076303723] [2022-04-07 23:19:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:19:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:19:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:19:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:28,206 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-07 23:19:28,206 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-07 23:19:28,207 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-07 23:19:28,207 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-07 23:19:28,208 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-07 23:19:28,208 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-07 23:19:28,208 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-07 23:19:28,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-07 23:19:28,210 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-07 23:19:28,210 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-07 23:19:28,212 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-07 23:19:28,212 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-07 23:19:28,214 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-07 23:19:28,217 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-07 23:19:28,220 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-07 23:19:28,223 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-07 23:19:28,224 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-07 23:19:28,224 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-07 23:19:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:19:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:19:28,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076303723] [2022-04-07 23:19:28,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076303723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:19:28,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914702697] [2022-04-07 23:19:28,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:19:28,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:19:28,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:19:28,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:19:28,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 23:19:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:28,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 23:19:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:19:28,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:19:28,802 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-07 23:19:28,802 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-07 23:19:28,803 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-07 23:19:28,803 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-07 23:19:28,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-07 23:19:28,807 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-07 23:19:28,808 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-07 23:19:28,809 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-07 23:19:28,810 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-07 23:19:28,810 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-07 23:19:28,811 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-07 23:19:28,812 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-07 23:19:28,813 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-07 23:19:28,813 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-07 23:19:28,814 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-07 23:19:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:19:28,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:19:29,177 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-07 23:19:29,178 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-07 23:19:29,179 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-07 23:19:29,180 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-07 23:19:29,181 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-07 23:19:29,182 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-07 23:19:31,292 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-07 23:19:31,293 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-07 23:19:31,294 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-07 23:19:31,295 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-07 23:19:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-07 23:19:31,295 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-07 23:19:31,295 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-07 23:19:31,295 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-07 23:19:31,296 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-07 23:19:31,296 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-07 23:19:31,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914702697] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:19:31,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:19:31,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-07 23:19:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853845138] [2022-04-07 23:19:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:19:31,297 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-07 23:19:31,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:19:31,298 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-07 23:19:33,435 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-07 23:19:33,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:19:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:19:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:19:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:19:33,437 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-07 23:19:35,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:44,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:46,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:55,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:59,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:19:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:19:59,686 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-07 23:19:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:19:59,687 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-07 23:19:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:19:59,687 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-07 23:19:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 23:19:59,689 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-07 23:19:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 23:19:59,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-07 23:20:01,863 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-07 23:20:01,864 INFO L225 Difference]: With dead ends: 28 [2022-04-07 23:20:01,864 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 23:20:01,865 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-07 23:20:01,866 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-07 23:20:01,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-07 23:20:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 23:20:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 23:20:01,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:20:01,870 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-07 23:20:01,870 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-07 23:20:01,870 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-07 23:20:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:01,872 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 23:20:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 23:20:01,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:20:01,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:20:01,873 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-07 23:20:01,873 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-07 23:20:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:01,874 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 23:20:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 23:20:01,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:20:01,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:20:01,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:20:01,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:20:01,875 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-07 23:20:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-07 23:20:01,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-07 23:20:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:20:01,877 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-07 23:20:01,877 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-07 23:20:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 23:20:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 23:20:01,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:20:01,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:20:01,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:20:02,091 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-07 23:20:02,092 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:20:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:20:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1132300265, now seen corresponding path program 1 times [2022-04-07 23:20:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:20:02,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196221926] [2022-04-07 23:20:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:20:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:20:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:20:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:02,433 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-07 23:20:02,434 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-07 23:20:02,435 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-07 23:20:02,436 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-07 23:20:02,437 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-07 23:20:02,437 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-07 23:20:02,438 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-07 23:20:02,439 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-07 23:20:02,440 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-07 23:20:02,440 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-07 23:20:02,441 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-07 23:20:02,441 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-07 23:20:02,442 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-07 23:20:02,442 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-07 23:20:02,442 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-07 23:20:02,442 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-07 23:20:02,442 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-07 23:20:02,442 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-07 23:20:02,443 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-07 23:20:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:20:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:20:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196221926] [2022-04-07 23:20:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196221926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:20:02,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:20:02,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 23:20:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900919358] [2022-04-07 23:20:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:20:02,444 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-07 23:20:02,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:20:02,445 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-07 23:20:04,631 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-07 23:20:04,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 23:20:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:20:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 23:20:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 23:20:04,633 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-07 23:20:08,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:13,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:17,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:17,862 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-07 23:20:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:20:17,862 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-07 23:20:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:20:17,862 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-07 23:20:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 23:20:17,864 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-07 23:20:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 23:20:17,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 23:20:20,094 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-07 23:20:20,095 INFO L225 Difference]: With dead ends: 37 [2022-04-07 23:20:20,095 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 23:20:20,095 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-07 23:20:20,096 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:20:20,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-07 23:20:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 23:20:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-07 23:20:20,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:20:20,112 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-07 23:20:20,112 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-07 23:20:20,112 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-07 23:20:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:20,114 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 23:20:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 23:20:20,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:20:20,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:20:20,115 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-07 23:20:20,115 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-07 23:20:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:20,116 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 23:20:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 23:20:20,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:20:20,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:20:20,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:20:20,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:20:20,117 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-07 23:20:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-07 23:20:20,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-07 23:20:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:20:20,119 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-07 23:20:20,119 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-07 23:20:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-07 23:20:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 23:20:20,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:20:20,120 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:20:20,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 23:20:20,120 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:20:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:20:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash -932165961, now seen corresponding path program 1 times [2022-04-07 23:20:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:20:20,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522262272] [2022-04-07 23:20:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:20:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:20:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:20,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:20:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:20,469 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-07 23:20:20,469 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-07 23:20:20,470 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-07 23:20:20,471 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-07 23:20:20,472 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-07 23:20:20,473 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-07 23:20:20,477 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-07 23:20:20,477 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-07 23:20:20,478 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-07 23:20:20,478 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-07 23:20:20,479 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-07 23:20:20,479 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-07 23:20:20,480 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-07 23:20:20,482 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-07 23:20:20,482 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-07 23:20:20,486 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-07 23:20:20,486 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-07 23:20:20,486 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-07 23:20:20,486 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-07 23:20:20,486 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-07 23:20:20,487 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-07 23:20:20,487 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-07 23:20:20,487 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-07 23:20:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:20:20,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522262272] [2022-04-07 23:20:20,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522262272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:20:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133669681] [2022-04-07 23:20:20,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:20:20,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:20:20,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:20:20,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:20:20,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 23:20:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:20,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 23:20:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:20,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:20:21,080 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-07 23:20:21,080 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-07 23:20:21,080 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-07 23:20:21,081 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-07 23:20:21,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-07 23:20:21,088 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-07 23:20:21,088 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-07 23:20:21,089 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-07 23:20:21,090 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-07 23:20:21,090 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-07 23:20:21,091 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-07 23:20:21,091 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-07 23:20:21,092 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-07 23:20:21,093 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-07 23:20:21,110 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-07 23:20:21,112 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-07 23:20:21,112 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-07 23:20:21,114 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-07 23:20:21,114 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-07 23:20:21,115 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-07 23:20:21,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:20:21,425 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-07 23:20:21,426 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-07 23:20:21,426 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-07 23:20:21,427 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-07 23:20:21,432 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-07 23:20:21,433 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-07 23:20:23,538 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-07 23:20:23,539 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-07 23:20:23,544 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-07 23:20:23,548 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-07 23:20:25,652 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-07 23:20:25,652 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-07 23:20:25,653 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-07 23:20:25,653 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-07 23:20:25,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-07 23:20:25,654 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-07 23:20:25,654 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-07 23:20:25,654 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-07 23:20:25,654 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-07 23:20:25,654 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-07 23:20:25,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133669681] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:20:25,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:20:25,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-07 23:20:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417347899] [2022-04-07 23:20:25,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:20:25,655 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-07 23:20:25,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:20:25,656 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-07 23:20:29,925 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-07 23:20:29,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:20:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:20:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:20:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-07 23:20:29,926 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-07 23:20:31,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:34,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:38,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:42,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:49,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:20:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:49,599 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-07 23:20:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:20:49,600 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-07 23:20:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:20:49,600 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-07 23:20:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-07 23:20:49,602 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-07 23:20:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-07 23:20:49,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-07 23:20:53,888 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-07 23:20:53,889 INFO L225 Difference]: With dead ends: 33 [2022-04-07 23:20:53,889 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 23:20:53,889 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-07 23:20:53,890 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:20:53,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 10.4s Time] [2022-04-07 23:20:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 23:20:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-07 23:20:53,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:20:53,916 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-07 23:20:53,916 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-07 23:20:53,916 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-07 23:20:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:53,918 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 23:20:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 23:20:53,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:20:53,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:20:53,919 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-07 23:20:53,919 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-07 23:20:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:20:53,920 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 23:20:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 23:20:53,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:20:53,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:20:53,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:20:53,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:20:53,921 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-07 23:20:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-07 23:20:53,922 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-07 23:20:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:20:53,922 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-07 23:20:53,923 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-07 23:20:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-07 23:20:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 23:20:53,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:20:53,927 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-07 23:20:53,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 23:20:54,137 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-07 23:20:54,138 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:20:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:20:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1043545585, now seen corresponding path program 1 times [2022-04-07 23:20:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:20:54,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354395951] [2022-04-07 23:20:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:20:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:20:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:20:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:54,230 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-07 23:20:54,231 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-07 23:20:54,231 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-07 23:20:54,231 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-07 23:20:54,232 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-07 23:20:54,232 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-07 23:20:54,232 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-07 23:20:54,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-07 23:20:54,233 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-07 23:20:54,234 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-07 23:20:54,234 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-07 23:20:54,235 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-07 23:20:54,235 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-07 23:20:54,236 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-07 23:20:54,236 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-07 23:20:54,237 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-07 23:20:54,238 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-07 23:20:54,238 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-07 23:20:54,239 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-07 23:20:54,239 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-07 23:20:54,239 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-07 23:20:54,240 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-07 23:20:54,241 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-07 23:20:54,241 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-07 23:20:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:20:54,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354395951] [2022-04-07 23:20:54,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354395951] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:20:54,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074137923] [2022-04-07 23:20:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:20:54,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:20:54,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:20:54,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:20:54,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 23:20:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:54,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 23:20:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:20:54,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:20:54,817 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-07 23:20:54,817 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-07 23:20:54,817 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-07 23:20:54,817 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-07 23:20:54,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-07 23:20:54,818 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-07 23:20:54,819 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-07 23:20:54,819 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-07 23:20:54,820 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-07 23:20:54,821 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-07 23:20:54,821 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-07 23:20:54,822 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-07 23:20:54,822 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-07 23:20:54,823 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-07 23:20:54,824 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-07 23:20:54,824 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-07 23:20:54,826 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-07 23:20:54,826 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-07 23:20:54,826 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-07 23:20:54,827 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-07 23:20:54,827 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-07 23:20:54,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:20:55,167 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-07 23:20:55,170 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-07 23:20:55,170 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-07 23:20:55,171 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-07 23:20:55,171 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-07 23:20:55,173 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-07 23:20:55,176 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-07 23:20:55,177 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-07 23:20:55,177 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-07 23:20:55,178 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-07 23:20:55,179 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-07 23:20:57,303 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-07 23:20:57,303 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-07 23:20:57,304 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-07 23:20:57,304 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-07 23:20:57,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-07 23:20:57,304 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-07 23:20:57,305 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-07 23:20:57,305 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-07 23:20:57,305 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-07 23:20:57,305 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-07 23:20:57,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074137923] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:20:57,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:20:57,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 23:20:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77564318] [2022-04-07 23:20:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:20:57,306 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-07 23:20:57,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:20:57,306 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-07 23:20:59,460 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-07 23:20:59,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:20:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:20:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:20:59,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:20:59,463 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-07 23:21:01,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:03,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:05,858 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-07 23:21:08,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:10,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:12,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:14,514 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-07 23:21:16,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:21:16,852 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 23:21:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:21:16,853 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-07 23:21:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:21:16,853 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-07 23:21:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:21:16,856 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-07 23:21:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:21:16,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 23:21:19,033 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-07 23:21:19,034 INFO L225 Difference]: With dead ends: 40 [2022-04-07 23:21:19,034 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 23:21:19,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 23:21:19,035 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:21:19,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 17.2s Time] [2022-04-07 23:21:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 23:21:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 23:21:19,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:21:19,049 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-07 23:21:19,049 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-07 23:21:19,050 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-07 23:21:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:21:19,051 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-07 23:21:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 23:21:19,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:21:19,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:21:19,052 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-07 23:21:19,052 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-07 23:21:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:21:19,054 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-07 23:21:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 23:21:19,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:21:19,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:21:19,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:21:19,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:21:19,054 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-07 23:21:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 23:21:19,056 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-07 23:21:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:21:19,056 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 23:21:19,056 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-07 23:21:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 23:21:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 23:21:19,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:21:19,057 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-07 23:21:19,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 23:21:19,257 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-07 23:21:19,258 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:21:19,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:21:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -58795524, now seen corresponding path program 1 times [2022-04-07 23:21:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:21:19,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748486239] [2022-04-07 23:21:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:21:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:21:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:21:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:19,679 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-07 23:21:19,680 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-07 23:21:19,681 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-07 23:21:19,682 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-07 23:21:19,682 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-07 23:21:19,683 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-07 23:21:19,684 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-07 23:21:19,685 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-07 23:21:19,685 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-07 23:21:19,686 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-07 23:21:19,686 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-07 23:21:19,686 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-07 23:21:19,687 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-07 23:21:19,695 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-07 23:21:19,696 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-07 23:21:19,697 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-07 23:21:19,699 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-07 23:21:19,705 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-07 23:21:19,707 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-07 23:21:19,708 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-07 23:21:19,708 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-07 23:21:19,708 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-07 23:21:19,708 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-07 23:21:19,709 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-07 23:21:19,709 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-07 23:21:19,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:21:19,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748486239] [2022-04-07 23:21:19,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748486239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:21:19,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126669968] [2022-04-07 23:21:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:21:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:21:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:21:19,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:21:19,723 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-07 23:21:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:19,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 23:21:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:19,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:21:20,442 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-07 23:21:20,443 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-07 23:21:20,443 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-07 23:21:20,443 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-07 23:21:20,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-07 23:21:20,444 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-07 23:21:20,444 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-07 23:21:20,445 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-07 23:21:20,446 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-07 23:21:20,446 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-07 23:21:20,447 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-07 23:21:20,447 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-07 23:21:20,448 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-07 23:21:20,449 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-07 23:21:20,449 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-07 23:21:20,450 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-07 23:21:20,450 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-07 23:21:20,452 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-07 23:21:20,452 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-07 23:21:20,452 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-07 23:21:20,453 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-07 23:21:20,453 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-07 23:21:20,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:21:20,827 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-07 23:21:20,827 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-07 23:21:20,828 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-07 23:21:20,829 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-07 23:21:20,829 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-07 23:21:20,831 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-07 23:21:22,947 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-07 23:21:22,951 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-07 23:21:22,952 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-07 23:21:22,953 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-07 23:21:22,953 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-07 23:21:22,958 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-07 23:21:25,081 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-07 23:21:25,082 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-07 23:21:25,082 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-07 23:21:25,083 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-07 23:21:25,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-07 23:21:25,083 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-07 23:21:25,083 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-07 23:21:25,083 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-07 23:21:25,084 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-07 23:21:25,084 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-07 23:21:25,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126669968] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:21:25,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:21:25,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-07 23:21:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130993843] [2022-04-07 23:21:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:21:25,086 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-07 23:21:25,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:21:25,086 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-07 23:21:27,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 23:21:27,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:21:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:21:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:21:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-07 23:21:27,242 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-07 23:21:29,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:31,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:33,614 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-07 23:21:35,737 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-07 23:21:37,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:40,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:42,222 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-07 23:21:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:21:42,490 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-07 23:21:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:21:42,490 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-07 23:21:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:21:42,491 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-07 23:21:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:21:42,492 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-07 23:21:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:21:42,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 23:21:46,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 23:21:46,774 INFO L225 Difference]: With dead ends: 45 [2022-04-07 23:21:46,774 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 23:21:46,775 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-07 23:21:46,776 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.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, 51 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:21:46,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 15.1s Time] [2022-04-07 23:21:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 23:21:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-07 23:21:46,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:21:46,790 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-07 23:21:46,790 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-07 23:21:46,790 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-07 23:21:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:21:46,791 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 23:21:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-07 23:21:46,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:21:46,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:21:46,792 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-07 23:21:46,792 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-07 23:21:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:21:46,794 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 23:21:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-07 23:21:46,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:21:46,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:21:46,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:21:46,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:21:46,795 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-07 23:21:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-07 23:21:46,796 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-07 23:21:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:21:46,796 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-07 23:21:46,796 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-07 23:21:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 23:21:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 23:21:46,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:21:46,797 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-07 23:21:46,817 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-07 23:21:47,011 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-07 23:21:47,011 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:21:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:21:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2116274639, now seen corresponding path program 1 times [2022-04-07 23:21:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:21:47,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253342706] [2022-04-07 23:21:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:21:47,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:21:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:21:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:47,111 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-07 23:21:47,111 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-07 23:21:47,111 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-07 23:21:47,112 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-07 23:21:47,112 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-07 23:21:47,112 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-07 23:21:47,112 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-07 23:21:47,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-07 23:21:47,113 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-07 23:21:47,113 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-07 23:21:47,113 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-07 23:21:47,114 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-07 23:21:47,114 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-07 23:21:47,115 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-07 23:21:47,116 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-07 23:21:47,116 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-07 23:21:47,117 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-07 23:21:47,117 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-07 23:21:47,118 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-07 23:21:47,118 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-07 23:21:47,118 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-07 23:21:47,118 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-07 23:21:47,119 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-07 23:21:47,119 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-07 23:21:47,120 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-07 23:21:47,120 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-07 23:21:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:21:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253342706] [2022-04-07 23:21:47,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253342706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:21:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230636952] [2022-04-07 23:21:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:21:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:21:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:21:47,122 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-07 23:21:47,123 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-07 23:21:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:47,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 23:21:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:21:47,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:21:47,743 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-07 23:21:47,743 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-07 23:21:47,743 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-07 23:21:47,743 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-07 23:21:47,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-07 23:21:47,744 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-07 23:21:47,744 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-07 23:21:47,745 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-07 23:21:47,745 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-07 23:21:47,746 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-07 23:21:47,746 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-07 23:21:47,746 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-07 23:21:47,747 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-07 23:21:47,747 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-07 23:21:47,748 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-07 23:21:47,748 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-07 23:21:47,749 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-07 23:21:47,749 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-07 23:21:47,750 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-07 23:21:47,750 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-07 23:21:47,751 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-07 23:21:47,751 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-07 23:21:47,751 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-07 23:21:47,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:21:48,003 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-07 23:21:48,004 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-07 23:21:48,004 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-07 23:21:48,005 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-07 23:21:48,006 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-07 23:21:48,007 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-07 23:21:48,024 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-07 23:21:48,025 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-07 23:21:48,026 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-07 23:21:48,026 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-07 23:21:48,026 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-07 23:21:48,027 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-07 23:21:48,028 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-07 23:21:50,143 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-07 23:21:50,144 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-07 23:21:50,144 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-07 23:21:50,144 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-07 23:21:50,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-07 23:21:50,145 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-07 23:21:50,145 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-07 23:21:50,145 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-07 23:21:50,145 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-07 23:21:50,145 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-07 23:21:50,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230636952] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:21:50,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:21:50,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 23:21:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290783729] [2022-04-07 23:21:50,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:21:50,146 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-07 23:21:50,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:21:50,146 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-07 23:21:52,291 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-07 23:21:52,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:21:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:21:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:21:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:21:52,292 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-07 23:21:54,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:56,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:21:58,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-07 23:22:00,787 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-07 23:22:02,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:05,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:07,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-07 23:22:09,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:11,803 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-07 23:22:13,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:22:14,151 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-07 23:22:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:22:14,151 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-07 23:22:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:22:14,153 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-07 23:22:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 23:22:14,154 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-07 23:22:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 23:22:14,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-07 23:22:16,383 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-07 23:22:16,384 INFO L225 Difference]: With dead ends: 53 [2022-04-07 23:22:16,384 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 23:22:16,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 23:22:16,385 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:22:16,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 10 Unknown, 0 Unchecked, 21.2s Time] [2022-04-07 23:22:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 23:22:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-07 23:22:16,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:22:16,403 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-07 23:22:16,404 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-07 23:22:16,404 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-07 23:22:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:22:16,405 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 23:22:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 23:22:16,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:22:16,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:22:16,406 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-07 23:22:16,406 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-07 23:22:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:22:16,408 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 23:22:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 23:22:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:22:16,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:22:16,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:22:16,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:22:16,409 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-07 23:22:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-07 23:22:16,410 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-07 23:22:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:22:16,411 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-07 23:22:16,411 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-07 23:22:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 23:22:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 23:22:16,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:22:16,411 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-07 23:22:16,438 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-07 23:22:16,635 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-07 23:22:16,636 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:22:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:22:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1618193969, now seen corresponding path program 1 times [2022-04-07 23:22:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:22:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500032930] [2022-04-07 23:22:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:22:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:22:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:22:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:16,738 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-07 23:22:16,738 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-07 23:22:16,738 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-07 23:22:16,739 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-07 23:22:16,739 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-07 23:22:16,739 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-07 23:22:16,739 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-07 23:22:16,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-07 23:22:16,740 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-07 23:22:16,740 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-07 23:22:16,741 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-07 23:22:16,741 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-07 23:22:16,741 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-07 23:22:16,742 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-07 23:22:16,742 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-07 23:22:16,743 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-07 23:22:16,744 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-07 23:22:16,744 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-07 23:22:16,745 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-07 23:22:16,745 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-07 23:22:16,746 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-07 23:22:16,746 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-07 23:22:16,746 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-07 23:22:16,746 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-07 23:22:16,746 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-07 23:22:16,746 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-07 23:22:16,747 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-07 23:22:16,747 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-07 23:22:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:22:16,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500032930] [2022-04-07 23:22:16,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500032930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:22:16,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091123562] [2022-04-07 23:22:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:22:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:22:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:22:16,748 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-07 23:22:16,755 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-07 23:22:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:16,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 23:22:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:16,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:22:17,463 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-07 23:22:17,463 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-07 23:22:17,464 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-07 23:22:17,464 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-07 23:22:17,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-07 23:22:17,464 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-07 23:22:17,465 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-07 23:22:17,465 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-07 23:22:17,466 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-07 23:22:17,467 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-07 23:22:17,467 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-07 23:22:17,468 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-07 23:22:17,468 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-07 23:22:17,469 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-07 23:22:17,469 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-07 23:22:17,470 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-07 23:22:17,471 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-07 23:22:17,471 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-07 23:22:17,472 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-07 23:22:17,472 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-07 23:22:17,473 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-07 23:22:17,474 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-07 23:22:17,474 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-07 23:22:17,474 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-07 23:22:17,475 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-07 23:22:17,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:22:17,798 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-07 23:22:17,799 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-07 23:22:17,799 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-07 23:22:17,800 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-07 23:22:17,801 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-07 23:22:17,802 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-07 23:22:17,808 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-07 23:22:17,809 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-07 23:22:17,809 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-07 23:22:17,809 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-07 23:22:17,811 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-07 23:22:19,920 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-07 23:22:19,921 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-07 23:22:19,921 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-07 23:22:19,926 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-07 23:22:22,038 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-07 23:22:22,039 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-07 23:22:22,039 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-07 23:22:22,040 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-07 23:22:22,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-07 23:22:22,040 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-07 23:22:22,040 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-07 23:22:22,040 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-07 23:22:22,040 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-07 23:22:22,041 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-07 23:22:22,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091123562] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:22:22,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:22:22,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-07 23:22:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856040435] [2022-04-07 23:22:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:22:22,041 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-07 23:22:22,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:22:22,042 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-07 23:22:26,321 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-07 23:22:26,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:22:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:22:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:22:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 23:22:26,322 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-07 23:22:28,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:30,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:32,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:34,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:37,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:39,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:22:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:22:39,478 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-04-07 23:22:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:22:39,479 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-07 23:22:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:22:39,479 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-07 23:22:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:22:39,480 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-07 23:22:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:22:39,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 23:22:43,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 23:22:43,794 INFO L225 Difference]: With dead ends: 59 [2022-04-07 23:22:43,794 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 23:22:43,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:22:43,795 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-07 23:22:43,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 12.7s Time] [2022-04-07 23:22:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 23:22:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-07 23:22:43,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:22:43,810 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-07 23:22:43,810 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-07 23:22:43,810 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-07 23:22:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:22:43,812 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-07 23:22:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-07 23:22:43,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:22:43,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:22:43,813 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-07 23:22:43,813 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-07 23:22:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:22:43,814 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-07 23:22:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-07 23:22:43,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:22:43,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:22:43,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:22:43,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:22:43,815 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-07 23:22:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-07 23:22:43,816 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-07 23:22:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:22:43,817 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-07 23:22:43,817 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-07 23:22:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-07 23:22:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 23:22:43,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:22:43,817 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-07 23:22:43,837 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-07 23:22:44,027 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-07 23:22:44,027 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:22:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:22:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash 850752026, now seen corresponding path program 1 times [2022-04-07 23:22:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:22:44,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356010221] [2022-04-07 23:22:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:22:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:22:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:22:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:44,389 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-07 23:22:44,390 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-07 23:22:44,391 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-07 23:22:44,391 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-07 23:22:44,392 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-07 23:22:44,392 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-07 23:22:44,393 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-07 23:22:44,393 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-07 23:22:44,394 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-07 23:22:44,394 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-07 23:22:44,395 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-07 23:22:44,395 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-07 23:22:44,396 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-07 23:22:44,396 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-07 23:22:44,397 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-07 23:22:44,397 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-07 23:22:44,401 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-07 23:22:44,408 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-07 23:22:44,408 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-07 23:22:44,409 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-07 23:22:44,410 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-07 23:22:44,412 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-07 23:22:44,412 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-07 23:22:44,412 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-07 23:22:44,412 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-07 23:22:44,412 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-07 23:22:44,412 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-07 23:22:44,412 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-07 23:22:44,413 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-07 23:22:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:22:44,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356010221] [2022-04-07 23:22:44,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356010221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:22:44,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593325238] [2022-04-07 23:22:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:22:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:22:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:22:44,414 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-07 23:22:44,415 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-07 23:22:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:44,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 23:22:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:22:44,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:22:45,175 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-07 23:22:45,175 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-07 23:22:45,175 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-07 23:22:45,176 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-07 23:22:45,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {2335#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-07 23:22:45,176 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-07 23:22:45,177 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-07 23:22:45,177 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-07 23:22:45,177 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-07 23:22:45,178 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-07 23:22:45,178 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-07 23:22:45,179 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-07 23:22:45,179 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-07 23:22:45,180 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-07 23:22:45,181 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-07 23:22:45,181 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-07 23:22:45,181 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-07 23:22:45,182 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-07 23:22:45,182 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-07 23:22:45,183 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-07 23:22:45,183 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-07 23:22:45,184 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-07 23:22:45,185 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-07 23:22:45,185 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-07 23:22:45,185 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-07 23:22:45,185 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-07 23:22:45,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:22:45,674 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-07 23:22:45,674 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-07 23:22:45,675 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-07 23:22:45,676 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-07 23:22:45,676 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-07 23:22:45,678 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-07 23:22:47,792 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-07 23:22:47,792 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-07 23:22:47,793 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-07 23:22:47,793 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-07 23:22:47,793 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-07 23:22:47,798 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-07 23:22:49,916 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-07 23:22:49,917 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-07 23:22:49,918 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-07 23:22:49,922 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-07 23:22:52,034 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-07 23:22:52,035 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-07 23:22:52,035 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-07 23:22:52,036 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-07 23:22:52,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {2335#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-07 23:22:52,036 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-07 23:22:52,036 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-07 23:22:52,036 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-07 23:22:52,037 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-07 23:22:52,037 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-07 23:22:52,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593325238] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:22:52,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:22:52,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-07 23:22:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678561954] [2022-04-07 23:22:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:22:52,038 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-07 23:22:52,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:22:52,039 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-07 23:22:58,422 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-07 23:22:58,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:22:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:22:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:22:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:22:58,423 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-07 23:23:00,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:23:04,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:23:07,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-07 23:23:09,177 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-07 23:23:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:09,472 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-07 23:23:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:23:09,472 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-07 23:23:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:23:09,472 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-07 23:23:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:23:09,473 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-07 23:23:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 23:23:09,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 23:23:15,918 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-07 23:23:15,919 INFO L225 Difference]: With dead ends: 56 [2022-04-07 23:23:15,919 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 23:23:15,919 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-07 23:23:15,920 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.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, 54 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:23:15,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 8.4s Time] [2022-04-07 23:23:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 23:23:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-07 23:23:15,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:23:15,933 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-07 23:23:15,934 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-07 23:23:15,934 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-07 23:23:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:15,936 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-07 23:23:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-07 23:23:15,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:15,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:15,937 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-07 23:23:15,937 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-07 23:23:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:15,938 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-07 23:23:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-07 23:23:15,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:15,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:15,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:23:15,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:23:15,939 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-07 23:23:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-07 23:23:15,940 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-07 23:23:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:23:15,940 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-07 23:23:15,940 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-07 23:23:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-07 23:23:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 23:23:15,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:23:15,941 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-07 23:23:15,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 23:23:16,141 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-07 23:23:16,142 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:23:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:23:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 309895635, now seen corresponding path program 1 times [2022-04-07 23:23:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:23:16,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660812274] [2022-04-07 23:23:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:23:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:23:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:16,376 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-07 23:23:16,376 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-07 23:23:16,377 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-07 23:23:16,377 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-07 23:23:16,378 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-07 23:23:16,378 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-07 23:23:16,379 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-07 23:23:16,379 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-07 23:23:16,380 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-07 23:23:16,380 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-07 23:23:16,380 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-07 23:23:16,381 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-07 23:23:16,381 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-07 23:23:16,382 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-07 23:23:16,382 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-07 23:23:16,384 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-07 23:23:16,384 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-07 23:23:16,384 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-07 23:23:16,384 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-07 23:23:16,384 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-07 23:23:16,384 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 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-07 23:23:16,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:23:16,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660812274] [2022-04-07 23:23:16,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660812274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:23:16,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207811939] [2022-04-07 23:23:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:16,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:23:16,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:23:16,387 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-07 23:23:16,388 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-07 23:23:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:16,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 23:23:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:16,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:23:17,054 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-07 23:23:17,055 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-07 23:23:17,055 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-07 23:23:17,055 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-07 23:23:17,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {2734#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-07 23:23:17,055 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-07 23:23:17,056 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-07 23:23:17,057 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-07 23:23:17,057 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-07 23:23:17,058 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-07 23:23:17,058 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-07 23:23:17,059 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-07 23:23:17,059 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-07 23:23:17,060 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-07 23:23:17,060 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-07 23:23:17,060 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-07 23:23:17,061 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-07 23:23:17,061 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-07 23:23:17,062 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-07 23:23:17,062 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-07 23:23:17,063 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-07 23:23:17,063 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-07 23:23:17,064 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-07 23:23:17,064 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-07 23:23:17,065 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-07 23:23:17,065 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-07 23:23:17,065 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-07 23:23:17,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:23:17,422 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-07 23:23:17,423 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-07 23:23:17,423 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-07 23:23:17,425 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-07 23:23:17,425 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-07 23:23:17,427 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-07 23:23:17,454 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-07 23:23:17,455 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-07 23:23:17,455 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-07 23:23:17,455 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-07 23:23:17,456 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-07 23:23:17,456 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-07 23:23:17,457 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-07 23:23:19,571 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-07 23:23:19,573 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-07 23:23:19,574 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-07 23:23:19,578 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-07 23:23:21,697 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-07 23:23:21,698 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-07 23:23:21,698 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-07 23:23:21,701 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-07 23:23:21,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {2734#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-07 23:23:21,701 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-07 23:23:21,701 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-07 23:23:21,701 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-07 23:23:21,701 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-07 23:23:21,702 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-07 23:23:21,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207811939] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:23:21,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:23:21,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 19 [2022-04-07 23:23:21,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371369312] [2022-04-07 23:23:21,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:23:21,703 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-07 23:23:21,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:23:21,703 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-07 23:23:25,970 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-07 23:23:25,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:23:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:23:25,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:23:25,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:23:25,971 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-07 23:23:28,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:23:30,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-07 23:23:32,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:23:34,669 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-07 23:23:36,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:23:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:39,241 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2022-04-07 23:23:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:23:39,242 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-07 23:23:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:23:39,242 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-07 23:23:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 23:23:39,243 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-07 23:23:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 23:23:39,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-07 23:23:43,607 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-07 23:23:43,607 INFO L225 Difference]: With dead ends: 58 [2022-04-07 23:23:43,608 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 23:23:43,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-07 23:23:43,609 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s 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.8s IncrementalHoareTripleChecker+Time [2022-04-07 23:23:43,609 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.8s Time] [2022-04-07 23:23:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 23:23:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-07 23:23:43,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:23:43,621 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-07 23:23:43,621 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-07 23:23:43,621 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-07 23:23:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:43,622 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-07 23:23:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-07 23:23:43,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:43,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:43,622 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-07 23:23:43,622 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-07 23:23:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:43,624 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-07 23:23:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-07 23:23:43,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:43,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:43,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:23:43,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:23:43,624 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-07 23:23:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-07 23:23:43,625 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-07 23:23:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:23:43,625 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-07 23:23:43,626 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-07 23:23:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-07 23:23:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 23:23:43,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:23:43,626 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-07 23:23:43,643 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-07 23:23:43,831 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-07 23:23:43,832 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:23:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:23:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 522176238, now seen corresponding path program 1 times [2022-04-07 23:23:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:23:43,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305318317] [2022-04-07 23:23:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:23:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:23:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:44,178 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-07 23:23:44,178 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-07 23:23:44,179 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-07 23:23:44,180 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-07 23:23:44,180 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-07 23:23:44,180 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-07 23:23:44,181 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-07 23:23:44,181 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-07 23:23:44,182 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-07 23:23:44,182 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-07 23:23:44,183 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-07 23:23:44,183 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-07 23:23:44,184 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-07 23:23:44,189 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-07 23:23:44,190 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-07 23:23:44,190 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-07 23:23:44,191 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-07 23:23:44,194 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-07 23:23:44,195 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-07 23:23:44,196 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-07 23:23:44,196 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-07 23:23:44,196 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-07 23:23:44,197 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-07 23:23:44,197 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-07 23:23:44,198 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-07 23:23:44,200 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-07 23:23:44,200 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-07 23:23:44,201 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-07 23:23:44,201 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-07 23:23:44,201 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-07 23:23:44,201 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-07 23:23:44,201 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-07 23:23:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:23:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305318317] [2022-04-07 23:23:44,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305318317] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:23:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384353518] [2022-04-07 23:23:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:44,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:23:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:23:44,203 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-07 23:23:44,204 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-07 23:23:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:44,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 23:23:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:44,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:23:45,006 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-07 23:23:45,007 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-07 23:23:45,007 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-07 23:23:45,007 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-07 23:23:45,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {3143#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-07 23:23:45,008 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-07 23:23:45,008 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-07 23:23:45,008 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-07 23:23:45,009 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-07 23:23:45,009 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-07 23:23:45,010 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-07 23:23:45,010 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-07 23:23:45,011 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-07 23:23:45,011 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-07 23:23:45,011 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-07 23:23:45,012 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-07 23:23:45,013 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-07 23:23:45,014 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-07 23:23:45,014 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-07 23:23:45,014 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-07 23:23:45,015 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-07 23:23:45,015 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-07 23:23:45,016 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-07 23:23:45,016 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-07 23:23:45,018 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-07 23:23:45,018 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-07 23:23:45,018 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-07 23:23:45,019 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-07 23:23:45,019 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-07 23:23:45,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:23:45,423 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-07 23:23:45,423 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-07 23:23:45,423 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-07 23:23:45,424 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-07 23:23:45,425 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-07 23:23:45,426 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-07 23:23:45,434 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-07 23:23:45,435 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-07 23:23:45,435 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-07 23:23:45,435 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-07 23:23:45,436 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-07 23:23:45,436 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-07 23:23:45,438 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-07 23:23:47,551 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-07 23:23:47,551 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-07 23:23:47,552 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-07 23:23:47,552 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-07 23:23:47,552 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-07 23:23:47,557 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-07 23:23:49,677 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-07 23:23:49,678 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-07 23:23:49,678 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-07 23:23:49,682 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-07 23:23:49,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {3143#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-07 23:23:49,682 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-07 23:23:49,682 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-07 23:23:49,682 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-07 23:23:49,682 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-07 23:23:49,683 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-07 23:23:49,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384353518] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:23:49,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:23:49,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-07 23:23:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376500138] [2022-04-07 23:23:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:23:49,683 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-07 23:23:49,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:23:49,684 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-07 23:23:53,972 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-07 23:23:53,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:23:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:23:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:23:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-07 23:23:53,974 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-07 23:23:58,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:00,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:02,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:04,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:24:05,226 INFO L93 Difference]: Finished difference Result 71 states and 107 transitions. [2022-04-07 23:24:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:24:05,226 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-07 23:24:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:24:05,227 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-07 23:24:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 23:24:05,228 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-07 23:24:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-07 23:24:05,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-07 23:24:09,606 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-07 23:24:09,607 INFO L225 Difference]: With dead ends: 71 [2022-04-07 23:24:09,607 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 23:24:09,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-07 23:24:09,608 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-07 23:24:09,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2022-04-07 23:24:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 23:24:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-07 23:24:09,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:24:09,629 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-07 23:24:09,629 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-07 23:24:09,629 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-07 23:24:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:24:09,631 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-07 23:24:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-07 23:24:09,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:24:09,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:24:09,631 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-07 23:24:09,632 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-07 23:24:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:24:09,633 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-07 23:24:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-07 23:24:09,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:24:09,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:24:09,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:24:09,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:24:09,634 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-07 23:24:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-07 23:24:09,635 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-07 23:24:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:24:09,635 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-07 23:24:09,636 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-07 23:24:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-07 23:24:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 23:24:09,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:24:09,636 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-07 23:24:09,658 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-07 23:24:09,851 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-07 23:24:09,852 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:24:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:24:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2133946640, now seen corresponding path program 1 times [2022-04-07 23:24:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:24:09,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212561900] [2022-04-07 23:24:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:24:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:24:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:24:09,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:24:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:24:09,965 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-07 23:24:09,965 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-07 23:24:09,965 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-07 23:24:09,966 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-07 23:24:09,966 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-07 23:24:09,966 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-07 23:24:09,966 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-07 23:24:09,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-07 23:24:09,966 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-07 23:24:09,967 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-07 23:24:09,967 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-07 23:24:09,967 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-07 23:24:09,968 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-07 23:24:09,968 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-07 23:24:09,968 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-07 23:24:09,969 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-07 23:24:09,969 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-07 23:24:09,970 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-07 23:24:09,970 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-07 23:24:09,970 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-07 23:24:09,971 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-07 23:24:09,971 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-07 23:24:09,972 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-07 23:24:09,972 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-07 23:24:09,972 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-07 23:24:09,973 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-07 23:24:09,973 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-07 23:24:09,973 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-07 23:24:09,974 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-07 23:24:09,974 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-07 23:24:09,974 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-07 23:24:09,974 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-07 23:24:09,974 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-07 23:24:09,974 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-07 23:24:09,975 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-07 23:24:09,975 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-07 23:24:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:24:09,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212561900] [2022-04-07 23:24:09,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212561900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:24:09,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995442168] [2022-04-07 23:24:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:24:09,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:24:09,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:24:09,976 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-07 23:24:09,979 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-07 23:24:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:24:10,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 23:24:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:24:10,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:24:10,831 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-07 23:24:10,831 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-07 23:24:10,831 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-07 23:24:10,831 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-07 23:24:10,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-07 23:24:10,832 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-07 23:24:10,832 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-07 23:24:10,833 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-07 23:24:10,833 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-07 23:24:10,834 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-07 23:24:10,834 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-07 23:24:10,835 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-07 23:24:10,836 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-07 23:24:10,836 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-07 23:24:10,837 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-07 23:24:10,837 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-07 23:24:10,838 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-07 23:24:10,838 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-07 23:24:10,839 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-07 23:24:10,839 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-07 23:24:10,840 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-07 23:24:10,840 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-07 23:24:10,841 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-07 23:24:10,841 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-07 23:24:10,842 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-07 23:24:10,843 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-07 23:24:10,843 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-07 23:24:10,844 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-07 23:24:10,845 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-07 23:24:10,845 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-07 23:24:10,846 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-07 23:24:10,846 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-07 23:24:10,846 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-07 23:24:10,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:24:11,229 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-07 23:24:11,229 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-07 23:24:11,230 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-07 23:24:11,231 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-07 23:24:11,231 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-07 23:24:11,232 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-07 23:24:11,276 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-07 23:24:11,277 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-07 23:24:11,277 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-07 23:24:11,277 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-07 23:24:11,278 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-07 23:24:11,278 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-07 23:24:11,279 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-07 23:24:13,397 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-07 23:24:13,398 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-07 23:24:13,398 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-07 23:24:13,399 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-07 23:24:13,399 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-07 23:24:13,406 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-07 23:24:15,520 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-07 23:24:15,521 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-07 23:24:15,522 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-07 23:24:15,527 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-07 23:24:17,640 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-07 23:24:17,641 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-07 23:24:17,641 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-07 23:24:17,644 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-07 23:24:17,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-07 23:24:17,644 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-07 23:24:17,644 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-07 23:24:17,644 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-07 23:24:17,645 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-07 23:24:17,645 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-07 23:24:17,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995442168] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:24:17,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:24:17,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 13] total 20 [2022-04-07 23:24:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129629681] [2022-04-07 23:24:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:24:17,646 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-07 23:24:17,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:24:17,646 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-07 23:24:24,055 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-07 23:24:24,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:24:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:24:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:24:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-07 23:24:24,056 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-07 23:24:26,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:28,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:32,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:24:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:24:33,061 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-07 23:24:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:24:33,062 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-07 23:24:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:24:33,062 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-07 23:24:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-07 23:24:33,063 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-07 23:24:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-07 23:24:33,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-07 23:24:39,518 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-07 23:24:39,518 INFO L225 Difference]: With dead ends: 66 [2022-04-07 23:24:39,518 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:24:39,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:24:39,519 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 47 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-07 23:24:39,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-07 23:24:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:24:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:24:39,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:24:39,520 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-07 23:24:39,520 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-07 23:24:39,520 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-07 23:24:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:24:39,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:24:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:24:39,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:24:39,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:24:39,521 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-07 23:24:39,521 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-07 23:24:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:24:39,521 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:24:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:24:39,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:24:39,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:24:39,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:24:39,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:24:39,521 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-07 23:24:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:24:39,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-07 23:24:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:24:39,522 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:24:39,522 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-07 23:24:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:24:39,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:24:39,523 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:24:39,540 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-07 23:24:39,724 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-07 23:24:39,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:24:39,902 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-07 23:24:39,902 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:24:39,902 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:24:39,902 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:24:39,903 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:24:39,903 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 39) the Hoare annotation is: true [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 39) no Hoare annotation was computed. [2022-04-07 23:24:39,903 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-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 39) no Hoare annotation was computed. [2022-04-07 23:24:39,903 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-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 34) no Hoare annotation was computed. [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point L31-2(lines 23 34) no Hoare annotation was computed. [2022-04-07 23:24:39,903 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 34) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point L31(lines 31 34) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-07 23:24:39,904 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-07 23:24:39,906 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:24:39,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:24:39,911 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:24:39,912 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:24:39,914 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:24:39,914 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 23:24:39,914 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 23:24:39,915 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 23:24:39,915 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-07 23:24:39,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:24:39 BasicIcfg [2022-04-07 23:24:39,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:24:39,926 INFO L158 Benchmark]: Toolchain (without parser) took 346995.63ms. Allocated memory was 188.7MB in the beginning and 289.4MB in the end (delta: 100.7MB). Free memory was 131.1MB in the beginning and 190.7MB in the end (delta: -59.7MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2022-04-07 23:24:39,926 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:24:39,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.10ms. Allocated memory was 188.7MB in the beginning and 289.4MB in the end (delta: 100.7MB). Free memory was 130.9MB in the beginning and 260.5MB in the end (delta: -129.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-07 23:24:39,927 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 289.4MB. Free memory was 260.5MB in the beginning and 259.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 23:24:39,927 INFO L158 Benchmark]: RCFGBuilder took 6809.97ms. Allocated memory is still 289.4MB. Free memory was 259.0MB in the beginning and 244.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-07 23:24:39,927 INFO L158 Benchmark]: IcfgTransformer took 28.96ms. Allocated memory is still 289.4MB. Free memory was 244.3MB in the beginning and 242.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:24:39,927 INFO L158 Benchmark]: TraceAbstraction took 339841.81ms. Allocated memory is still 289.4MB. Free memory was 242.2MB in the beginning and 190.7MB in the end (delta: 51.5MB). Peak memory consumption was 52.5MB. Max. memory is 8.0GB. [2022-04-07 23:24:39,928 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.13ms. Allocated memory is still 188.7MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.10ms. Allocated memory was 188.7MB in the beginning and 289.4MB in the end (delta: 100.7MB). Free memory was 130.9MB in the beginning and 260.5MB in the end (delta: -129.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 289.4MB. Free memory was 260.5MB in the beginning and 259.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6809.97ms. Allocated memory is still 289.4MB. Free memory was 259.0MB in the beginning and 244.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 28.96ms. Allocated memory is still 289.4MB. Free memory was 244.3MB in the beginning and 242.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 339841.81ms. Allocated memory is still 289.4MB. Free memory was 242.2MB in the beginning and 190.7MB in the end (delta: 51.5MB). Peak memory consumption was 52.5MB. 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: 339.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 241.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 65 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 138.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 131.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 595 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 187 mSDtfsCounter, 595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 364 SyntacticMatches, 36 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 5.2s 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 54.0s 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-07 23:24:39,951 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...