/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/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:20:24,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:20:24,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:20:24,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:20:24,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:20:24,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:20:24,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:20:24,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:20:24,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:20:24,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:20:24,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:20:24,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:20:24,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:20:24,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:20:24,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:20:24,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:20:24,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:20:24,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:20:24,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:20:24,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:20:24,421 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:20:24,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:20:24,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:20:24,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:20:24,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:20:24,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:20:24,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:20:24,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:20:24,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:20:24,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:20:24,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:20:24,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:20:24,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:20:24,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:20:24,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:20:24,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:20:24,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:20:24,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:20:24,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:20:24,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:20:24,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:20:24,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:20:24,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:20:24,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:20:24,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:20:24,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:20:24,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:20:24,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:20:24,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:20:24,460 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:20:24,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:20:24,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:20:24,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:20:24,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:20:24,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:20:24,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:20:24,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:20:24,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:20:24,465 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:20:24,465 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 01:20:24,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:20:24,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:20:24,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:20:24,675 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:20:24,676 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:20:24,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-15 01:20:24,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4da018f/ecb659d33f874664a29d4fd1c8042c56/FLAGed58dd6d1 [2022-04-15 01:20:25,100 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:20:25,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-15 01:20:25,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4da018f/ecb659d33f874664a29d4fd1c8042c56/FLAGed58dd6d1 [2022-04-15 01:20:25,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4da018f/ecb659d33f874664a29d4fd1c8042c56 [2022-04-15 01:20:25,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:20:25,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:20:25,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:20:25,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:20:25,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:20:25,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50119a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25, skipping insertion in model container [2022-04-15 01:20:25,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:20:25,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:20:25,297 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/sumt5.c[403,416] [2022-04-15 01:20:25,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:20:25,314 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:20:25,322 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/sumt5.c[403,416] [2022-04-15 01:20:25,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:20:25,336 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:20:25,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25 WrapperNode [2022-04-15 01:20:25,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:20:25,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:20:25,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:20:25,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:20:25,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:20:25,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:20:25,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:20:25,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:20:25,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (1/1) ... [2022-04-15 01:20:25,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:20:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:20:25,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 01:20:25,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 01:20:25,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:20:25,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:20:25,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:20:25,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 01:20:25,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:20:25,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:20:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:20:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:20:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:20:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:20:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:20:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:20:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:20:25,475 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:20:25,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:20:29,990 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:20:29,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:20:29,996 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:20:29,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:20:29 BoogieIcfgContainer [2022-04-15 01:20:29,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:20:29,998 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:20:29,998 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:20:29,999 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:20:30,001 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:20:29" (1/1) ... [2022-04-15 01:20:30,002 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:20:30,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:20:30 BasicIcfg [2022-04-15 01:20:30,026 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:20:30,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:20:30,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:20:30,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:20:30,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:20:25" (1/4) ... [2022-04-15 01:20:30,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:20:30, skipping insertion in model container [2022-04-15 01:20:30,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:20:25" (2/4) ... [2022-04-15 01:20:30,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:20:30, skipping insertion in model container [2022-04-15 01:20:30,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:20:29" (3/4) ... [2022-04-15 01:20:30,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:20:30, skipping insertion in model container [2022-04-15 01:20:30,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:20:30" (4/4) ... [2022-04-15 01:20:30,033 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.cqvasr [2022-04-15 01:20:30,037 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:20:30,038 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:20:30,071 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:20:30,077 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 01:20:30,077 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:20:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:20:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:20:30,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:20:30,112 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:20:30,112 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:20:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:20:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2113582840, now seen corresponding path program 1 times [2022-04-15 01:20:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:20:30,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75605285] [2022-04-15 01:20:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:20:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:20:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:30,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:20:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:30,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {28#true} is VALID [2022-04-15 01:20:30,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:20:30,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:20:30,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:20:30,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {28#true} is VALID [2022-04-15 01:20:30,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:20:30,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:20:30,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:20:30,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {28#true} is VALID [2022-04-15 01:20:30,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [81] 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[] {28#true} is VALID [2022-04-15 01:20:30,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} [83] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:20:30,344 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {29#false} is VALID [2022-04-15 01:20:30,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-15 01:20:30,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:20:30,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:20:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:20:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:20:30,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75605285] [2022-04-15 01:20:30,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75605285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:20:30,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:20:30,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:20:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543975057] [2022-04-15 01:20:30,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:20:30,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:20:30,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:20:30,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:30,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:20:30,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:20:30,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:20:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:20:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:20:30,408 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:20:34,887 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-15 01:20:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:20:34,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:20:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:20:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-15 01:20:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-15 01:20:34,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-04-15 01:20:34,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:20:34,973 INFO L225 Difference]: With dead ends: 37 [2022-04-15 01:20:34,974 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 01:20:34,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:20:34,979 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:20:34,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:20:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 01:20:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 01:20:35,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:20:35,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:35,007 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:35,007 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:20:35,009 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-04-15 01:20:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-15 01:20:35,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:20:35,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:20:35,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 01:20:35,011 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 01:20:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:20:35,013 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-04-15 01:20:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-15 01:20:35,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:20:35,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:20:35,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:20:35,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:20:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-04-15 01:20:35,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2022-04-15 01:20:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:20:35,017 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-04-15 01:20:35,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-15 01:20:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:20:35,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:20:35,019 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:20:35,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:20:35,019 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:20:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:20:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2112659319, now seen corresponding path program 1 times [2022-04-15 01:20:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:20:35,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714313580] [2022-04-15 01:20:35,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:20:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:20:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:20:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:35,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {143#true} is VALID [2022-04-15 01:20:35,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143#true} is VALID [2022-04-15 01:20:35,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143#true} is VALID [2022-04-15 01:20:35,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:20:35,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {143#true} is VALID [2022-04-15 01:20:35,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143#true} is VALID [2022-04-15 01:20:35,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143#true} is VALID [2022-04-15 01:20:35,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143#true} is VALID [2022-04-15 01:20:35,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {148#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:35,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {148#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:35,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {148#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:35,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {148#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {149#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:20:35,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {150#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:20:35,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#(not (= __VERIFIER_assert_~cond 0))} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {144#false} is VALID [2022-04-15 01:20:35,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {144#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#false} is VALID [2022-04-15 01:20:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:20:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:20:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714313580] [2022-04-15 01:20:35,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714313580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:20:35,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:20:35,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 01:20:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234697075] [2022-04-15 01:20:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:20:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:20:35,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:20:35,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:35,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:20:35,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:20:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:20:35,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:20:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:20:35,407 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:37,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:20:42,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:20:44,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:20:48,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:20:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:20:48,764 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 01:20:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:20:48,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:20:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:20:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 01:20:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 01:20:48,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-15 01:20:48,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:20:48,803 INFO L225 Difference]: With dead ends: 25 [2022-04-15 01:20:48,803 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 01:20:48,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:20:48,804 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-15 01:20:48,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-15 01:20:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 01:20:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 01:20:48,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:20:48,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,808 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,808 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:20:48,809 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-15 01:20:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 01:20:48,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:20:48,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:20:48,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 01:20:48,810 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 01:20:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:20:48,811 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-15 01:20:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 01:20:48,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:20:48,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:20:48,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:20:48,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:20:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-15 01:20:48,813 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-15 01:20:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:20:48,813 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-15 01:20:48,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-15 01:20:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 01:20:48,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:20:48,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:20:48,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:20:48,814 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:20:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:20:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1428544074, now seen corresponding path program 1 times [2022-04-15 01:20:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:20:48,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716859406] [2022-04-15 01:20:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:20:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:20:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:49,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:20:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:49,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {262#true} is VALID [2022-04-15 01:20:49,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:20:49,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {262#true} is VALID [2022-04-15 01:20:49,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:49,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:49,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {268#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:49,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(and (= main_~k~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))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {269#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:20:49,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {270#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-15 01:20:49,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {270#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {271#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} is VALID [2022-04-15 01:20:49,411 INFO L272 TraceCheckUtils]: 11: Hoare triple {271#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:20:49,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {272#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:20:49,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#(not (= __VERIFIER_assert_~cond 0))} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 01:20:49,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {263#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 01:20:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:20:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:20:49,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716859406] [2022-04-15 01:20:49,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716859406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:20:49,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344518216] [2022-04-15 01:20:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:20:49,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:20:49,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:20:49,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:20:49,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 01:20:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:49,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 01:20:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:20:49,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:20:49,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} [76] 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] {262#true} is VALID [2022-04-15 01:20:49,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:49,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:49,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:49,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:20:49,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {302#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:20:49,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {306#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:20:49,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {306#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:20:49,772 INFO L272 TraceCheckUtils]: 11: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:20:49,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:20:49,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 01:20:49,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {263#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 01:20:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:20:49,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:20:50,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {263#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 01:20:50,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 01:20:50,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {313#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:20:50,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:20:50,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:20:50,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:20:52,162 WARN L290 TraceCheckUtils]: 8: Hoare triple {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {340#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:20:52,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:20:52,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] 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[] {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:20:52,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {333#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:20:52,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:52,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:52,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:52,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} [76] 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] {262#true} is VALID [2022-04-15 01:20:52,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-04-15 01:20:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:20:52,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344518216] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:20:52,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:20:52,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-15 01:20:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866002761] [2022-04-15 01:20:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:20:52,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 01:20:52,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:20:52,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:54,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:20:54,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:20:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:20:54,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:20:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 01:20:54,303 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:20:56,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:05,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:09,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:09,675 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 01:21:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:21:09,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 01:21:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:21:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-15 01:21:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-15 01:21:09,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-15 01:21:11,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:11,826 INFO L225 Difference]: With dead ends: 27 [2022-04-15 01:21:11,826 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 01:21:11,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-15 01:21:11,827 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:21:11,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 01:21:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 01:21:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 01:21:11,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:21:11,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:11,832 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:11,832 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:11,833 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 01:21:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 01:21:11,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:11,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 01:21:11,834 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 01:21:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:11,835 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 01:21:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 01:21:11,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:11,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:11,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:21:11,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:21:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 01:21:11,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2022-04-15 01:21:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:21:11,837 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 01:21:11,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 01:21:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 01:21:11,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:21:11,837 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:21:11,854 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-15 01:21:12,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:21:12,054 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:21:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:21:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1493554663, now seen corresponding path program 1 times [2022-04-15 01:21:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:21:12,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636673950] [2022-04-15 01:21:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:21:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:21:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:12,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:12,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:12,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {483#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:12,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {483#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:21:12,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:12,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:12,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {492#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {483#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:12,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {488#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:12,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {488#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {489#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:12,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [81] 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[] {490#(= main_~l~0 0)} is VALID [2022-04-15 01:21:12,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {490#(= main_~l~0 0)} is VALID [2022-04-15 01:21:12,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(= main_~l~0 0)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {484#false} is VALID [2022-04-15 01:21:12,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#false} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {484#false} is VALID [2022-04-15 01:21:12,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#false} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {484#false} is VALID [2022-04-15 01:21:12,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {484#false} is VALID [2022-04-15 01:21:12,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {484#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {484#false} is VALID [2022-04-15 01:21:12,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {484#false} is VALID [2022-04-15 01:21:12,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {484#false} is VALID [2022-04-15 01:21:12,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#false} is VALID [2022-04-15 01:21:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:21:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:21:12,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636673950] [2022-04-15 01:21:12,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636673950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:21:12,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:21:12,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 01:21:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385759566] [2022-04-15 01:21:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:21:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 01:21:12,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:21:12,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:14,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:14,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 01:21:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:21:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 01:21:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:21:14,565 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:18,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:23,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:25,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:25,761 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 01:21:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:21:25,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 01:21:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:21:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:21:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 01:21:25,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 01:21:27,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:27,978 INFO L225 Difference]: With dead ends: 35 [2022-04-15 01:21:27,978 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 01:21:27,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:21:27,979 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 60 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:21:27,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 26 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 01:21:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 01:21:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 01:21:27,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:21:27,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:27,994 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:27,994 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:27,995 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-15 01:21:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-15 01:21:28,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:28,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:28,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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 24 states. [2022-04-15 01:21:28,001 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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 24 states. [2022-04-15 01:21:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:28,002 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-15 01:21:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-15 01:21:28,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:28,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:28,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:21:28,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:21:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 01:21:28,003 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-15 01:21:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:21:28,003 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 01:21:28,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 01:21:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 01:21:28,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:21:28,004 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:21:28,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 01:21:28,004 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:21:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:21:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1990443884, now seen corresponding path program 1 times [2022-04-15 01:21:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:21:28,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894638567] [2022-04-15 01:21:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:21:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:28,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:21:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:28,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {633#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {626#true} is VALID [2022-04-15 01:21:28,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {626#true} {626#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {626#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {633#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:21:28,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {633#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {626#true} is VALID [2022-04-15 01:21:28,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {626#true} {626#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {626#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {631#(= main_~l~0 0)} is VALID [2022-04-15 01:21:28,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {631#(= main_~l~0 0)} [81] 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[] {631#(= main_~l~0 0)} is VALID [2022-04-15 01:21:28,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {631#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {631#(= main_~l~0 0)} is VALID [2022-04-15 01:21:28,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {631#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {631#(= main_~l~0 0)} is VALID [2022-04-15 01:21:28,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {631#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {632#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:21:28,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {632#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {632#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:21:28,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {632#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {632#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-15 01:21:28,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {632#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {627#false} is VALID [2022-04-15 01:21:28,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {627#false} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {627#false} is VALID [2022-04-15 01:21:28,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {627#false} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,085 INFO L272 TraceCheckUtils]: 15: Hoare triple {627#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {627#false} is VALID [2022-04-15 01:21:28,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {627#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {627#false} is VALID [2022-04-15 01:21:28,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {627#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:21:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:21:28,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894638567] [2022-04-15 01:21:28,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894638567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:21:28,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510590163] [2022-04-15 01:21:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:28,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:21:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:21:28,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:21:28,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 01:21:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:28,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 01:21:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:28,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:21:28,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {626#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#true} [76] 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] {626#true} is VALID [2022-04-15 01:21:28,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {626#true} {626#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {626#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:28,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {652#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:28,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {652#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:28,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {652#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:28,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {662#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {662#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {666#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {666#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {666#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {680#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {680#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-15 01:21:28,455 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:21:28,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:21:28,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {691#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:21:28,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:21:28,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {691#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {627#false} is VALID [2022-04-15 01:21:28,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:21:28,685 INFO L272 TraceCheckUtils]: 15: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:21:28,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:28,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {714#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:28,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {714#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:28,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:28,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:28,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:30,834 WARN L290 TraceCheckUtils]: 8: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {714#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:21:30,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:30,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] 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[] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:30,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {707#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:30,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {626#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:30,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {626#true} {626#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:30,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:30,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#true} [76] 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] {626#true} is VALID [2022-04-15 01:21:30,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {626#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#true} is VALID [2022-04-15 01:21:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:21:30,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510590163] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:21:30,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:21:30,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-15 01:21:30,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281580263] [2022-04-15 01:21:30,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:21:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 01:21:30,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:21:30,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:33,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:33,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:21:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:21:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:21:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 01:21:33,003 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:35,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:37,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:39,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:41,732 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 01:21:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:21:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 01:21:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:21:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 01:21:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 01:21:41,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 01:21:43,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:43,904 INFO L225 Difference]: With dead ends: 33 [2022-04-15 01:21:43,904 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 01:21:43,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:21:43,905 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 01:21:43,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 01:21:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 01:21:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-15 01:21:43,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:21:43,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:43,914 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:43,915 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:43,916 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 01:21:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 01:21:43,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:43,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:43,916 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 28 states. [2022-04-15 01:21:43,916 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 28 states. [2022-04-15 01:21:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:43,917 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 01:21:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-15 01:21:43,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:21:43,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:21:43,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:21:43,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:21:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-15 01:21:43,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-04-15 01:21:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:21:43,919 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-15 01:21:43,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 01:21:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 01:21:43,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:21:43,920 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:21:43,946 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-15 01:21:44,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:21:44,135 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:21:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:21:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 509577165, now seen corresponding path program 1 times [2022-04-15 01:21:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:21:44,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609797904] [2022-04-15 01:21:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:21:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:21:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:44,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {904#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:44,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:44,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {892#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:44,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {892#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {904#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:21:44,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {904#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:44,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:21:44,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {892#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:44,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {897#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:44,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {897#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {898#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:21:44,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {898#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [81] 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[] {899#(= main_~l~0 0)} is VALID [2022-04-15 01:21:44,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {899#(= main_~l~0 0)} is VALID [2022-04-15 01:21:44,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {899#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {899#(= main_~l~0 0)} is VALID [2022-04-15 01:21:44,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {899#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {900#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:21:44,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {900#(<= (+ (* (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)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {901#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:21:44,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {901#(<= (+ (* (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)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {901#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:21:44,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {901#(<= (+ (* (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] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {901#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:21:44,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {901#(<= (+ (* (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)} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {902#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:21:44,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {902#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {903#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-15 01:21:44,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {903#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:44,509 INFO L272 TraceCheckUtils]: 16: Hoare triple {893#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {893#false} is VALID [2022-04-15 01:21:44,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {893#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {893#false} is VALID [2022-04-15 01:21:44,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {893#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:44,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {893#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:21:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:21:44,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609797904] [2022-04-15 01:21:44,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609797904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:21:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748937155] [2022-04-15 01:21:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:21:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:21:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:21:44,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:21:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 01:21:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:44,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 01:21:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:21:44,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:21:44,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {892#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:44,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {892#true} [76] 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] {892#true} is VALID [2022-04-15 01:21:44,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {892#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:44,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {892#true} {892#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:44,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {892#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:44,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {892#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {924#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:44,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {924#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:44,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {924#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {924#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:21:44,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {934#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {934#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {951#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {955#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {955#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {955#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-15 01:21:44,946 INFO L272 TraceCheckUtils]: 16: Hoare triple {955#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {962#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:21:44,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {962#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {966#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:21:44,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:44,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {893#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:21:44,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:21:45,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {893#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:45,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {893#false} is VALID [2022-04-15 01:21:45,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {962#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {966#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:21:45,242 INFO L272 TraceCheckUtils]: 16: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {962#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:21:45,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:45,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {989#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:47,349 WARN L290 TraceCheckUtils]: 13: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {989#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:21:47,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:47,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:47,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:47,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:49,463 WARN L290 TraceCheckUtils]: 8: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {989#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:21:49,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:49,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] 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[] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:49,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {892#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {982#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:21:49,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {892#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:49,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {892#true} {892#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:49,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {892#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:49,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {892#true} [76] 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] {892#true} is VALID [2022-04-15 01:21:49,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {892#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {892#true} is VALID [2022-04-15 01:21:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:21:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748937155] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:21:49,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:21:49,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-15 01:21:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302339209] [2022-04-15 01:21:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:21:49,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 01:21:49,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:21:49,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:53,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 16 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:21:53,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:21:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:21:53,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:21:53,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-15 01:21:53,755 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:55,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:58,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:21:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:21:58,343 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 01:21:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:21:58,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 01:21:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:21:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 01:21:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:21:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 01:21:58,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 01:22:02,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:02,630 INFO L225 Difference]: With dead ends: 34 [2022-04-15 01:22:02,630 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 01:22:02,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 01:22:02,633 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:22:02,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 01:22:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 01:22:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-15 01:22:02,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:22:02,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:02,647 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:02,647 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:02,650 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 01:22:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 01:22:02,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:02,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:02,652 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 29 states. [2022-04-15 01:22:02,652 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 29 states. [2022-04-15 01:22:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:02,657 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-15 01:22:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 01:22:02,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:02,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:02,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:22:02,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:22:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 01:22:02,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 20 [2022-04-15 01:22:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:22:02,661 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 01:22:02,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 01:22:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 01:22:02,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:22:02,661 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:22:02,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 01:22:02,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:02,873 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:22:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:22:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash 843369465, now seen corresponding path program 1 times [2022-04-15 01:22:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:22:02,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79395336] [2022-04-15 01:22:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:22:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:02,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:22:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:02,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {1181#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1174#true} is VALID [2022-04-15 01:22:02,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:02,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:02,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:22:02,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1174#true} is VALID [2022-04-15 01:22:02,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:02,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:02,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:02,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1179#(= main_~l~0 0)} is VALID [2022-04-15 01:22:02,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {1179#(= main_~l~0 0)} [81] 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[] {1179#(= main_~l~0 0)} is VALID [2022-04-15 01:22:02,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1179#(= main_~l~0 0)} is VALID [2022-04-15 01:22:02,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1179#(= main_~l~0 0)} is VALID [2022-04-15 01:22:02,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:22:02,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:22:02,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:22:02,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:22:02,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-15 01:22:02,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {1180#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {1175#false} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#false} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L272 TraceCheckUtils]: 17: Hoare triple {1175#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {1175#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:22:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:22:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79395336] [2022-04-15 01:22:02,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79395336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:22:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315960181] [2022-04-15 01:22:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:22:02,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:22:02,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 01:22:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:02,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 01:22:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:02,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:22:03,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:03,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} [76] 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] {1174#true} is VALID [2022-04-15 01:22:03,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:03,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:03,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:03,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1200#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:03,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {1200#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:03,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1200#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1200#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:03,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {1200#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1210#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1210#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {1214#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1230#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:03,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {1230#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1234#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-15 01:22:03,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {1234#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1234#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-15 01:22:03,339 INFO L272 TraceCheckUtils]: 17: Hoare triple {1234#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:22:03,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1245#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:22:03,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {1245#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:03,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:22:03,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:22:03,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:03,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {1245#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1175#false} is VALID [2022-04-15 01:22:03,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1245#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:22:03,558 INFO L272 TraceCheckUtils]: 17: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1241#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:22:03,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {1268#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1268#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:03,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:05,733 WARN L290 TraceCheckUtils]: 8: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1268#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:22:05,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:05,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] 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[] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:05,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1261#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:05,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:05,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:05,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:05,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} [76] 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] {1174#true} is VALID [2022-04-15 01:22:05,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#true} is VALID [2022-04-15 01:22:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:22:05,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315960181] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:22:05,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:22:05,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-15 01:22:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280164679] [2022-04-15 01:22:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:22:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 01:22:05,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:22:05,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:07,911 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-15 01:22:07,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:22:07,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:22:07,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:22:07,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 01:22:07,912 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:09,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:12,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:14,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:16,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:18,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:18,898 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-15 01:22:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:22:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 01:22:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:22:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 01:22:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 01:22:18,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-15 01:22:21,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:21,136 INFO L225 Difference]: With dead ends: 41 [2022-04-15 01:22:21,136 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 01:22:21,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 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-15 01:22:21,137 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-15 01:22:21,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-15 01:22:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 01:22:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 01:22:21,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:22:21,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:21,153 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:21,153 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:21,154 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-15 01:22:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-15 01:22:21,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:21,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:21,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 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 36 states. [2022-04-15 01:22:21,155 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 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 36 states. [2022-04-15 01:22:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:21,157 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-15 01:22:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-15 01:22:21,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:21,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:21,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:22:21,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:22:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 01:22:21,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 21 [2022-04-15 01:22:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:22:21,159 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2022-04-15 01:22:21,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-15 01:22:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 01:22:21,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:22:21,160 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:22:21,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 01:22:21,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:21,375 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:22:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:22:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 292028624, now seen corresponding path program 1 times [2022-04-15 01:22:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:22:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772110553] [2022-04-15 01:22:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:22:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:22:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:21,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {1504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:21,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:21,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1491#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1496#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:21,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1491#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:22:21,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:21,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 01:22:21,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1491#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1496#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:21,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {1496#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1496#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:21,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {1496#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1497#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:22:21,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {1497#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [81] 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[] {1498#(= main_~l~0 0)} is VALID [2022-04-15 01:22:21,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {1498#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1498#(= main_~l~0 0)} is VALID [2022-04-15 01:22:21,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {1498#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1498#(= main_~l~0 0)} is VALID [2022-04-15 01:22:21,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {1498#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1499#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:22:21,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#(<= (+ (* (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)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1500#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:22:21,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {1500#(<= (+ (* (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)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1500#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:22:21,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {1500#(<= (+ (* (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] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1500#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:22:21,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1500#(<= (+ (* (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)} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {1501#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-15 01:22:21,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {1501#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:22:21,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:22:21,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:22:21,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:22:21,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:22:21,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-15 01:22:21,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {1502#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1503#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-15 01:22:21,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {1503#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:21,801 INFO L272 TraceCheckUtils]: 22: Hoare triple {1492#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1492#false} is VALID [2022-04-15 01:22:21,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {1492#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1492#false} is VALID [2022-04-15 01:22:21,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {1492#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:21,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {1492#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:22:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:22:21,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772110553] [2022-04-15 01:22:21,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772110553] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:22:21,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071501801] [2022-04-15 01:22:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:22:21,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:21,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:22:21,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:22:21,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 01:22:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:21,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 01:22:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:22:21,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:22:22,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {1491#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:22,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#true} [76] 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] {1491#true} is VALID [2022-04-15 01:22:22,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {1491#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:22,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1491#true} {1491#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:22,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {1491#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:22,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {1491#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:22,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {1524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] 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[] {1524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:22,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {1524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 01:22:22,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {1524#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1534#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:22,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {1534#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:22,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:22,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:22,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 01:22:22,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {1538#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {1551#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {1551#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {1555#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1571#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:22:22,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {1571#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1575#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} is VALID [2022-04-15 01:22:22,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {1575#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1575#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} is VALID [2022-04-15 01:22:22,478 INFO L272 TraceCheckUtils]: 22: Hoare triple {1575#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:22:22,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {1582#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:22:22,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {1586#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:22,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {1492#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:22:22,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:22:22,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {1492#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:22,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {1586#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1492#false} is VALID [2022-04-15 01:22:22,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {1582#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:22:22,866 INFO L272 TraceCheckUtils]: 22: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ 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) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, 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_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:22:22,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1609#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:22,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:24,985 WARN L290 TraceCheckUtils]: 13: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {1609#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:22:24,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:24,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:24,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:24,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:27,100 WARN L290 TraceCheckUtils]: 8: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1609#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-15 01:22:27,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:27,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] 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[] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:27,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {1491#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 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)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, 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_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1602#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-15 01:22:27,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {1491#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:27,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1491#true} {1491#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:27,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {1491#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:27,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#true} [76] 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] {1491#true} is VALID [2022-04-15 01:22:27,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {1491#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1491#true} is VALID [2022-04-15 01:22:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 01:22:27,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071501801] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:22:27,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:22:27,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-15 01:22:27,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057391234] [2022-04-15 01:22:27,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:22:27,103 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 26 [2022-04-15 01:22:27,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:22:27,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:31,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:31,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:22:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:22:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:22:31,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-15 01:22:31,363 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:33,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:22:35,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-15 01:22:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:35,958 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-15 01:22:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:22:35,959 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 26 [2022-04-15 01:22:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:22:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-15 01:22:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-15 01:22:35,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-15 01:22:40,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:22:40,256 INFO L225 Difference]: With dead ends: 36 [2022-04-15 01:22:40,256 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:22:40,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 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-15 01:22:40,257 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:22:40,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 01:22:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:22:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:22:40,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:22:40,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:22:40,258 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:22:40,258 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:22:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:40,258 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:22:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:22:40,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:40,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:40,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:22:40,258 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:22:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:22:40,258 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:22:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:22:40,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:40,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:22:40,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:22:40,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:22:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:22:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:22:40,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-15 01:22:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:22:40,259 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:22:40,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:22:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:22:40,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:22:40,261 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:22:40,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 01:22:40,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:22:40,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:22:40,569 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 01:22:40,569 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:22:40,569 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:22:40,569 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:22:40,569 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-15 01:22:40,569 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 37) the Hoare annotation is: true [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 37) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 37) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 32) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L29-2(lines 23 32) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 32) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 32) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 32) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-15 01:22:40,570 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-15 01:22:40,573 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:22:40,574 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:22:40,578 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:22:40,578 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 01:22:40,578 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:22:40,579 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:22:40,580 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:22:40,580 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 01:22:40,580 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-15 01:22:40,580 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 01:22:40,581 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 01:22:40,581 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:22:40,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:22:40 BasicIcfg [2022-04-15 01:22:40,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:22:40,590 INFO L158 Benchmark]: Toolchain (without parser) took 135468.79ms. Allocated memory was 174.1MB in the beginning and 244.3MB in the end (delta: 70.3MB). Free memory was 115.4MB in the beginning and 199.9MB in the end (delta: -84.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:22:40,591 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:22:40,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.56ms. Allocated memory was 174.1MB in the beginning and 244.3MB in the end (delta: 70.3MB). Free memory was 115.2MB in the beginning and 215.3MB in the end (delta: -100.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-15 01:22:40,591 INFO L158 Benchmark]: Boogie Preprocessor took 25.90ms. Allocated memory is still 244.3MB. Free memory was 215.3MB in the beginning and 213.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:22:40,592 INFO L158 Benchmark]: RCFGBuilder took 4626.01ms. Allocated memory is still 244.3MB. Free memory was 213.7MB in the beginning and 200.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 01:22:40,594 INFO L158 Benchmark]: IcfgTransformer took 28.08ms. Allocated memory is still 244.3MB. Free memory was 200.6MB in the beginning and 199.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:22:40,595 INFO L158 Benchmark]: TraceAbstraction took 130562.51ms. Allocated memory is still 244.3MB. Free memory was 198.5MB in the beginning and 199.9MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:22:40,596 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.09ms. Allocated memory is still 174.1MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.56ms. Allocated memory was 174.1MB in the beginning and 244.3MB in the end (delta: 70.3MB). Free memory was 115.2MB in the beginning and 215.3MB in the end (delta: -100.1MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.90ms. Allocated memory is still 244.3MB. Free memory was 215.3MB in the beginning and 213.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 4626.01ms. Allocated memory is still 244.3MB. Free memory was 213.7MB in the beginning and 200.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 28.08ms. Allocated memory is still 244.3MB. Free memory was 200.6MB in the beginning and 199.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 130562.51ms. Allocated memory is still 244.3MB. Free memory was 198.5MB in the beginning and 199.9MB in the end (delta: -1.4MB). There was no memory consumed. 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 130.5s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 90.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 46.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 44.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 119 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 163 SyntacticMatches, 15 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 62 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 277 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 3411 SizeOfPredicates, 5 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 37/91 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: (l % 4294967296 == (i + k + j + v3 + v4) % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2022-04-15 01:22:40,627 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...